./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2bd23b8476745cc5eeb44766af6c01d42c768ef8188ecd9b3f71230eca21db6b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:55:09,336 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:55:09,419 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 10:55:09,424 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:55:09,427 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:55:09,453 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:55:09,454 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:55:09,455 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:55:09,456 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:55:09,458 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:55:09,458 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:55:09,459 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:55:09,459 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:55:09,460 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:55:09,462 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:55:09,463 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:55:09,463 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:55:09,463 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:55:09,464 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:55:09,464 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:55:09,464 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:55:09,465 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:55:09,465 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 10:55:09,466 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:55:09,466 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:55:09,466 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:55:09,467 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:55:09,467 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:55:09,468 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:55:09,468 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:55:09,468 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:55:09,469 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:55:09,469 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:55:09,469 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:55:09,470 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:55:09,470 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:55:09,471 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 10:55:09,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 10:55:09,471 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:55:09,471 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:55:09,472 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:55:09,472 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:55:09,472 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 -> 2bd23b8476745cc5eeb44766af6c01d42c768ef8188ecd9b3f71230eca21db6b [2024-10-13 10:55:09,814 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:55:09,842 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:55:09,847 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:55:09,848 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:55:09,849 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:55:09,850 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i [2024-10-13 10:55:11,454 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:55:11,719 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:55:11,721 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-sentinel-2.i [2024-10-13 10:55:11,735 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fca87ba33/f51beaab53d643fabe0a4b2dad4b1b3b/FLAGfce2d8636 [2024-10-13 10:55:11,747 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fca87ba33/f51beaab53d643fabe0a4b2dad4b1b3b [2024-10-13 10:55:11,749 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:55:11,750 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:55:11,753 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:55:11,754 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:55:11,760 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:55:11,761 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:55:11" (1/1) ... [2024-10-13 10:55:11,762 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74e1002b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:11, skipping insertion in model container [2024-10-13 10:55:11,764 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:55:11" (1/1) ... [2024-10-13 10:55:11,809 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:55:12,106 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:55:12,114 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 10:55:12,162 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:55:12,194 INFO L204 MainTranslator]: Completed translation [2024-10-13 10:55:12,194 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:12 WrapperNode [2024-10-13 10:55:12,194 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:55:12,195 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 10:55:12,195 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 10:55:12,196 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 10:55:12,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:12" (1/1) ... [2024-10-13 10:55:12,215 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:12" (1/1) ... [2024-10-13 10:55:12,244 INFO L138 Inliner]: procedures = 119, calls = 51, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 170 [2024-10-13 10:55:12,245 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 10:55:12,246 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 10:55:12,246 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 10:55:12,246 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 10:55:12,261 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:12" (1/1) ... [2024-10-13 10:55:12,261 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:12" (1/1) ... [2024-10-13 10:55:12,264 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:12" (1/1) ... [2024-10-13 10:55:12,283 INFO L175 MemorySlicer]: Split 32 memory accesses to 2 slices as follows [2, 30]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 15 writes are split as follows [0, 15]. [2024-10-13 10:55:12,284 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:12" (1/1) ... [2024-10-13 10:55:12,284 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:12" (1/1) ... [2024-10-13 10:55:12,293 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:12" (1/1) ... [2024-10-13 10:55:12,297 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:12" (1/1) ... [2024-10-13 10:55:12,299 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:12" (1/1) ... [2024-10-13 10:55:12,301 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:12" (1/1) ... [2024-10-13 10:55:12,304 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 10:55:12,305 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 10:55:12,305 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 10:55:12,305 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 10:55:12,306 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:12" (1/1) ... [2024-10-13 10:55:12,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:55:12,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:55:12,344 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 10:55:12,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 10:55:12,396 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-13 10:55:12,396 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-13 10:55:12,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 10:55:12,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 10:55:12,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 10:55:12,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 10:55:12,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 10:55:12,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 10:55:12,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 10:55:12,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 10:55:12,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 10:55:12,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 10:55:12,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 10:55:12,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 10:55:12,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 10:55:12,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 10:55:12,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 10:55:12,509 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 10:55:12,511 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 10:55:13,045 INFO L? ?]: Removed 135 outVars from TransFormulas that were not future-live. [2024-10-13 10:55:13,046 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 10:55:13,095 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 10:55:13,095 INFO L314 CfgBuilder]: Removed 17 assume(true) statements. [2024-10-13 10:55:13,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:55:13 BoogieIcfgContainer [2024-10-13 10:55:13,096 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 10:55:13,100 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 10:55:13,100 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 10:55:13,105 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 10:55:13,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:55:11" (1/3) ... [2024-10-13 10:55:13,106 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19e9004c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:55:13, skipping insertion in model container [2024-10-13 10:55:13,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:12" (2/3) ... [2024-10-13 10:55:13,108 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19e9004c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:55:13, skipping insertion in model container [2024-10-13 10:55:13,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:55:13" (3/3) ... [2024-10-13 10:55:13,110 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel-2.i [2024-10-13 10:55:13,129 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 10:55:13,129 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 74 error locations. [2024-10-13 10:55:13,193 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 10:55:13,203 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;@31ce2885, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 10:55:13,204 INFO L334 AbstractCegarLoop]: Starting to check reachability of 74 error locations. [2024-10-13 10:55:13,210 INFO L276 IsEmpty]: Start isEmpty. Operand has 159 states, 76 states have (on average 2.3815789473684212) internal successors, (181), 150 states have internal predecessors, (181), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 10:55:13,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-13 10:55:13,217 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:13,218 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-13 10:55:13,219 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-10-13 10:55:13,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:13,226 INFO L85 PathProgramCache]: Analyzing trace with hash 11669, now seen corresponding path program 1 times [2024-10-13 10:55:13,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:13,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159117236] [2024-10-13 10:55:13,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:13,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:13,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:13,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:13,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:13,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159117236] [2024-10-13 10:55:13,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159117236] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:13,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:13,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 10:55:13,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292159786] [2024-10-13 10:55:13,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:13,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:55:13,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:13,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:55:13,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:55:13,496 INFO L87 Difference]: Start difference. First operand has 159 states, 76 states have (on average 2.3815789473684212) internal successors, (181), 150 states have internal predecessors, (181), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:13,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:13,775 INFO L93 Difference]: Finished difference Result 174 states and 188 transitions. [2024-10-13 10:55:13,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:55:13,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-13 10:55:13,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:13,791 INFO L225 Difference]: With dead ends: 174 [2024-10-13 10:55:13,792 INFO L226 Difference]: Without dead ends: 173 [2024-10-13 10:55:13,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:55:13,800 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 126 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:13,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 99 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:55:13,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-10-13 10:55:13,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 150. [2024-10-13 10:55:13,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 72 states have (on average 2.1805555555555554) internal successors, (157), 148 states have internal predecessors, (157), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:13,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 164 transitions. [2024-10-13 10:55:13,843 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 164 transitions. Word has length 2 [2024-10-13 10:55:13,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:13,844 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 164 transitions. [2024-10-13 10:55:13,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:13,844 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 164 transitions. [2024-10-13 10:55:13,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-13 10:55:13,846 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:13,847 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-13 10:55:13,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 10:55:13,847 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-10-13 10:55:13,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:13,848 INFO L85 PathProgramCache]: Analyzing trace with hash 11670, now seen corresponding path program 1 times [2024-10-13 10:55:13,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:13,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944899859] [2024-10-13 10:55:13,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:13,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:13,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:13,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:13,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:13,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944899859] [2024-10-13 10:55:13,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944899859] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:13,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:13,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 10:55:13,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813995754] [2024-10-13 10:55:13,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:13,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:55:13,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:13,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:55:13,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:55:13,963 INFO L87 Difference]: Start difference. First operand 150 states and 164 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:14,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:14,136 INFO L93 Difference]: Finished difference Result 146 states and 159 transitions. [2024-10-13 10:55:14,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:55:14,137 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-13 10:55:14,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:14,138 INFO L225 Difference]: With dead ends: 146 [2024-10-13 10:55:14,138 INFO L226 Difference]: Without dead ends: 146 [2024-10-13 10:55:14,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:55:14,139 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 134 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:14,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 84 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:55:14,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-10-13 10:55:14,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2024-10-13 10:55:14,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 72 states have (on average 2.111111111111111) internal successors, (152), 144 states have internal predecessors, (152), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:14,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 159 transitions. [2024-10-13 10:55:14,162 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 159 transitions. Word has length 2 [2024-10-13 10:55:14,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:14,163 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 159 transitions. [2024-10-13 10:55:14,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:14,163 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 159 transitions. [2024-10-13 10:55:14,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-13 10:55:14,163 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:14,164 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 10:55:14,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 10:55:14,164 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-10-13 10:55:14,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:14,164 INFO L85 PathProgramCache]: Analyzing trace with hash 347626676, now seen corresponding path program 1 times [2024-10-13 10:55:14,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:14,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818143070] [2024-10-13 10:55:14,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:14,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:14,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:14,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:14,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:14,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818143070] [2024-10-13 10:55:14,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818143070] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:14,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:14,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:55:14,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664349941] [2024-10-13 10:55:14,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:14,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:55:14,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:14,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:55:14,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:55:14,338 INFO L87 Difference]: Start difference. First operand 146 states and 159 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:14,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:14,516 INFO L93 Difference]: Finished difference Result 140 states and 154 transitions. [2024-10-13 10:55:14,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:55:14,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-13 10:55:14,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:14,518 INFO L225 Difference]: With dead ends: 140 [2024-10-13 10:55:14,519 INFO L226 Difference]: Without dead ends: 140 [2024-10-13 10:55:14,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:55:14,521 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 104 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:14,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 91 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:55:14,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-10-13 10:55:14,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-10-13 10:55:14,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 73 states have (on average 2.0136986301369864) internal successors, (147), 138 states have internal predecessors, (147), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:14,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 154 transitions. [2024-10-13 10:55:14,541 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 154 transitions. Word has length 5 [2024-10-13 10:55:14,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:14,542 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 154 transitions. [2024-10-13 10:55:14,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:14,542 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 154 transitions. [2024-10-13 10:55:14,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-13 10:55:14,542 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:14,543 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 10:55:14,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 10:55:14,543 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-10-13 10:55:14,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:14,546 INFO L85 PathProgramCache]: Analyzing trace with hash 347626677, now seen corresponding path program 1 times [2024-10-13 10:55:14,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:14,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671184157] [2024-10-13 10:55:14,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:14,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:14,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:14,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:14,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:14,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671184157] [2024-10-13 10:55:14,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671184157] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:14,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:14,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:55:14,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797538668] [2024-10-13 10:55:14,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:14,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:55:14,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:14,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:55:14,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:55:14,697 INFO L87 Difference]: Start difference. First operand 140 states and 154 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:14,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:14,823 INFO L93 Difference]: Finished difference Result 142 states and 156 transitions. [2024-10-13 10:55:14,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:55:14,824 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-13 10:55:14,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:14,825 INFO L225 Difference]: With dead ends: 142 [2024-10-13 10:55:14,825 INFO L226 Difference]: Without dead ends: 142 [2024-10-13 10:55:14,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:55:14,826 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 98 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:14,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 105 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:55:14,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-13 10:55:14,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-10-13 10:55:14,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 78 states have (on average 1.9102564102564104) internal successors, (149), 140 states have internal predecessors, (149), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:14,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 156 transitions. [2024-10-13 10:55:14,840 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 156 transitions. Word has length 5 [2024-10-13 10:55:14,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:14,841 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 156 transitions. [2024-10-13 10:55:14,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:14,841 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 156 transitions. [2024-10-13 10:55:14,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 10:55:14,842 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:14,842 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:14,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 10:55:14,842 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-10-13 10:55:14,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:14,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1334688605, now seen corresponding path program 1 times [2024-10-13 10:55:14,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:14,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505007537] [2024-10-13 10:55:14,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:14,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:14,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:15,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:15,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:15,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505007537] [2024-10-13 10:55:15,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505007537] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:15,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:15,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:55:15,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228677814] [2024-10-13 10:55:15,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:15,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:55:15,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:15,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:55:15,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:55:15,035 INFO L87 Difference]: Start difference. First operand 142 states and 156 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-10-13 10:55:15,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:15,226 INFO L93 Difference]: Finished difference Result 129 states and 145 transitions. [2024-10-13 10:55:15,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:55:15,227 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-10-13 10:55:15,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:15,228 INFO L225 Difference]: With dead ends: 129 [2024-10-13 10:55:15,228 INFO L226 Difference]: Without dead ends: 129 [2024-10-13 10:55:15,228 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-10-13 10:55:15,229 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 135 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:15,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 78 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:55:15,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-10-13 10:55:15,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2024-10-13 10:55:15,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 80 states have (on average 1.725) internal successors, (138), 127 states have internal predecessors, (138), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:15,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 145 transitions. [2024-10-13 10:55:15,244 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 145 transitions. Word has length 10 [2024-10-13 10:55:15,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:15,244 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 145 transitions. [2024-10-13 10:55:15,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-10-13 10:55:15,245 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 145 transitions. [2024-10-13 10:55:15,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 10:55:15,247 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:15,248 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:15,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 10:55:15,248 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-10-13 10:55:15,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:15,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1334688606, now seen corresponding path program 1 times [2024-10-13 10:55:15,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:15,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669778051] [2024-10-13 10:55:15,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:15,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:15,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:15,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:15,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:15,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669778051] [2024-10-13 10:55:15,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669778051] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:15,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:15,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:55:15,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42303460] [2024-10-13 10:55:15,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:15,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:55:15,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:15,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:55:15,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:55:15,497 INFO L87 Difference]: Start difference. First operand 129 states and 145 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-10-13 10:55:15,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:15,711 INFO L93 Difference]: Finished difference Result 140 states and 157 transitions. [2024-10-13 10:55:15,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:55:15,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-10-13 10:55:15,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:15,713 INFO L225 Difference]: With dead ends: 140 [2024-10-13 10:55:15,713 INFO L226 Difference]: Without dead ends: 140 [2024-10-13 10:55:15,713 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-10-13 10:55:15,714 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 114 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:15,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 122 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:55:15,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-10-13 10:55:15,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2024-10-13 10:55:15,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 89 states have (on average 1.6741573033707866) internal successors, (149), 135 states have internal predecessors, (149), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:15,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 156 transitions. [2024-10-13 10:55:15,729 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 156 transitions. Word has length 10 [2024-10-13 10:55:15,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:15,730 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 156 transitions. [2024-10-13 10:55:15,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-10-13 10:55:15,730 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 156 transitions. [2024-10-13 10:55:15,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 10:55:15,735 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:15,735 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:15,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 10:55:15,735 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-10-13 10:55:15,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:15,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1559181362, now seen corresponding path program 1 times [2024-10-13 10:55:15,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:15,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996184211] [2024-10-13 10:55:15,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:15,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:15,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:15,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:15,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:15,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996184211] [2024-10-13 10:55:15,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996184211] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:15,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:15,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:55:15,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338848165] [2024-10-13 10:55:15,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:15,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:55:15,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:15,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:55:15,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:55:15,899 INFO L87 Difference]: Start difference. First operand 137 states and 156 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:16,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:16,073 INFO L93 Difference]: Finished difference Result 136 states and 154 transitions. [2024-10-13 10:55:16,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:55:16,075 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2024-10-13 10:55:16,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:16,076 INFO L225 Difference]: With dead ends: 136 [2024-10-13 10:55:16,076 INFO L226 Difference]: Without dead ends: 136 [2024-10-13 10:55:16,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:55:16,077 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 3 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:16,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 310 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:55:16,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-13 10:55:16,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-10-13 10:55:16,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 89 states have (on average 1.651685393258427) internal successors, (147), 134 states have internal predecessors, (147), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:16,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 154 transitions. [2024-10-13 10:55:16,090 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 154 transitions. Word has length 12 [2024-10-13 10:55:16,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:16,090 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 154 transitions. [2024-10-13 10:55:16,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:16,093 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 154 transitions. [2024-10-13 10:55:16,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 10:55:16,094 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:16,094 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:16,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 10:55:16,094 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-10-13 10:55:16,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:16,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1559181361, now seen corresponding path program 1 times [2024-10-13 10:55:16,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:16,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562577667] [2024-10-13 10:55:16,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:16,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:16,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:16,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:16,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:16,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562577667] [2024-10-13 10:55:16,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562577667] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:16,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:16,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:55:16,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232266914] [2024-10-13 10:55:16,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:16,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:55:16,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:16,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:55:16,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:55:16,333 INFO L87 Difference]: Start difference. First operand 136 states and 154 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:16,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:16,507 INFO L93 Difference]: Finished difference Result 135 states and 152 transitions. [2024-10-13 10:55:16,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:55:16,507 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2024-10-13 10:55:16,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:16,508 INFO L225 Difference]: With dead ends: 135 [2024-10-13 10:55:16,509 INFO L226 Difference]: Without dead ends: 135 [2024-10-13 10:55:16,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:55:16,510 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 2 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:16,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 299 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:55:16,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-13 10:55:16,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-10-13 10:55:16,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 89 states have (on average 1.6292134831460674) internal successors, (145), 133 states have internal predecessors, (145), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:16,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 152 transitions. [2024-10-13 10:55:16,516 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 152 transitions. Word has length 12 [2024-10-13 10:55:16,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:16,516 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 152 transitions. [2024-10-13 10:55:16,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:16,521 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 152 transitions. [2024-10-13 10:55:16,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 10:55:16,524 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:16,525 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:16,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 10:55:16,525 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-10-13 10:55:16,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:16,525 INFO L85 PathProgramCache]: Analyzing trace with hash 342184981, now seen corresponding path program 1 times [2024-10-13 10:55:16,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:16,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926359475] [2024-10-13 10:55:16,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:16,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:16,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:16,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:16,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:16,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926359475] [2024-10-13 10:55:16,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926359475] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:16,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:16,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:55:16,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382883696] [2024-10-13 10:55:16,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:16,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:55:16,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:16,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:55:16,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:55:16,596 INFO L87 Difference]: Start difference. First operand 135 states and 152 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:16,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:16,797 INFO L93 Difference]: Finished difference Result 166 states and 184 transitions. [2024-10-13 10:55:16,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:55:16,798 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-13 10:55:16,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:16,800 INFO L225 Difference]: With dead ends: 166 [2024-10-13 10:55:16,800 INFO L226 Difference]: Without dead ends: 166 [2024-10-13 10:55:16,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:55:16,802 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 236 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:16,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 141 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:55:16,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-13 10:55:16,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 137. [2024-10-13 10:55:16,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 92 states have (on average 1.5978260869565217) internal successors, (147), 135 states have internal predecessors, (147), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:16,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 153 transitions. [2024-10-13 10:55:16,810 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 153 transitions. Word has length 14 [2024-10-13 10:55:16,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:16,811 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 153 transitions. [2024-10-13 10:55:16,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:16,812 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 153 transitions. [2024-10-13 10:55:16,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 10:55:16,812 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:16,812 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:16,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 10:55:16,813 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-10-13 10:55:16,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:16,814 INFO L85 PathProgramCache]: Analyzing trace with hash 570592693, now seen corresponding path program 1 times [2024-10-13 10:55:16,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:16,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505210881] [2024-10-13 10:55:16,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:16,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:16,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:17,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:17,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:17,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505210881] [2024-10-13 10:55:17,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505210881] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:17,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:17,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 10:55:17,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931485713] [2024-10-13 10:55:17,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:17,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:55:17,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:17,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:55:17,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:55:17,084 INFO L87 Difference]: Start difference. First operand 137 states and 153 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:17,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:17,360 INFO L93 Difference]: Finished difference Result 136 states and 152 transitions. [2024-10-13 10:55:17,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 10:55:17,361 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-13 10:55:17,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:17,361 INFO L225 Difference]: With dead ends: 136 [2024-10-13 10:55:17,362 INFO L226 Difference]: Without dead ends: 136 [2024-10-13 10:55:17,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-13 10:55:17,362 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 127 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:17,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 151 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:55:17,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-13 10:55:17,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-10-13 10:55:17,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 92 states have (on average 1.5869565217391304) internal successors, (146), 134 states have internal predecessors, (146), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:17,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 152 transitions. [2024-10-13 10:55:17,367 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 152 transitions. Word has length 14 [2024-10-13 10:55:17,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:17,367 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 152 transitions. [2024-10-13 10:55:17,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:17,368 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 152 transitions. [2024-10-13 10:55:17,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 10:55:17,368 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:17,368 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:17,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 10:55:17,369 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-10-13 10:55:17,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:17,369 INFO L85 PathProgramCache]: Analyzing trace with hash 570592694, now seen corresponding path program 1 times [2024-10-13 10:55:17,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:17,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482177462] [2024-10-13 10:55:17,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:17,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:17,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:17,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:17,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:17,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482177462] [2024-10-13 10:55:17,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482177462] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:17,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:17,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 10:55:17,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793543189] [2024-10-13 10:55:17,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:17,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 10:55:17,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:17,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 10:55:17,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-13 10:55:17,703 INFO L87 Difference]: Start difference. First operand 136 states and 152 transitions. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:18,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:18,267 INFO L93 Difference]: Finished difference Result 148 states and 168 transitions. [2024-10-13 10:55:18,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 10:55:18,268 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-13 10:55:18,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:18,269 INFO L225 Difference]: With dead ends: 148 [2024-10-13 10:55:18,269 INFO L226 Difference]: Without dead ends: 148 [2024-10-13 10:55:18,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2024-10-13 10:55:18,270 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 167 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:18,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 288 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 10:55:18,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-10-13 10:55:18,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 138. [2024-10-13 10:55:18,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 100 states have (on average 1.51) internal successors, (151), 136 states have internal predecessors, (151), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:18,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 157 transitions. [2024-10-13 10:55:18,274 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 157 transitions. Word has length 14 [2024-10-13 10:55:18,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:18,275 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 157 transitions. [2024-10-13 10:55:18,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:18,275 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 157 transitions. [2024-10-13 10:55:18,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-13 10:55:18,275 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:18,276 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:18,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 10:55:18,276 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-10-13 10:55:18,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:18,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1295017745, now seen corresponding path program 1 times [2024-10-13 10:55:18,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:18,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063842412] [2024-10-13 10:55:18,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:18,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:18,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:18,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:18,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:18,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063842412] [2024-10-13 10:55:18,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063842412] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:18,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:18,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 10:55:18,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265848092] [2024-10-13 10:55:18,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:18,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:55:18,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:18,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:55:18,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:55:18,443 INFO L87 Difference]: Start difference. First operand 138 states and 157 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:18,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:18,696 INFO L93 Difference]: Finished difference Result 179 states and 205 transitions. [2024-10-13 10:55:18,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 10:55:18,696 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-13 10:55:18,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:18,697 INFO L225 Difference]: With dead ends: 179 [2024-10-13 10:55:18,697 INFO L226 Difference]: Without dead ends: 179 [2024-10-13 10:55:18,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2024-10-13 10:55:18,698 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 250 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:18,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 258 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:55:18,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-10-13 10:55:18,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 145. [2024-10-13 10:55:18,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 107 states have (on average 1.485981308411215) internal successors, (159), 143 states have internal predecessors, (159), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:18,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 165 transitions. [2024-10-13 10:55:18,703 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 165 transitions. Word has length 17 [2024-10-13 10:55:18,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:18,703 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 165 transitions. [2024-10-13 10:55:18,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:18,704 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 165 transitions. [2024-10-13 10:55:18,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-13 10:55:18,704 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:18,704 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:18,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 10:55:18,705 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-10-13 10:55:18,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:18,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1834740430, now seen corresponding path program 1 times [2024-10-13 10:55:18,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:18,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340999668] [2024-10-13 10:55:18,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:18,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:18,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:18,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:18,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:18,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340999668] [2024-10-13 10:55:18,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340999668] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:18,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:18,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:55:18,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955024876] [2024-10-13 10:55:18,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:18,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:55:18,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:18,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:55:18,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:55:18,839 INFO L87 Difference]: Start difference. First operand 145 states and 165 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:18,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:18,973 INFO L93 Difference]: Finished difference Result 144 states and 164 transitions. [2024-10-13 10:55:18,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:55:18,973 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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 19 [2024-10-13 10:55:18,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:18,974 INFO L225 Difference]: With dead ends: 144 [2024-10-13 10:55:18,974 INFO L226 Difference]: Without dead ends: 144 [2024-10-13 10:55:18,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:55:18,975 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 2 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:18,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 286 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:55:18,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-10-13 10:55:18,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-10-13 10:55:18,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 107 states have (on average 1.4766355140186915) internal successors, (158), 142 states have internal predecessors, (158), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:18,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 164 transitions. [2024-10-13 10:55:18,980 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 164 transitions. Word has length 19 [2024-10-13 10:55:18,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:18,980 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 164 transitions. [2024-10-13 10:55:18,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:18,980 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 164 transitions. [2024-10-13 10:55:18,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-13 10:55:18,981 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:18,981 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:18,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 10:55:18,982 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-10-13 10:55:18,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:18,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1834740429, now seen corresponding path program 1 times [2024-10-13 10:55:18,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:18,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625651618] [2024-10-13 10:55:18,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:18,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:19,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:19,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:19,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:19,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625651618] [2024-10-13 10:55:19,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625651618] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:19,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:19,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:55:19,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539408620] [2024-10-13 10:55:19,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:19,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:55:19,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:19,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:55:19,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:55:19,183 INFO L87 Difference]: Start difference. First operand 144 states and 164 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:19,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:19,332 INFO L93 Difference]: Finished difference Result 143 states and 163 transitions. [2024-10-13 10:55:19,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:55:19,333 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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 19 [2024-10-13 10:55:19,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:19,334 INFO L225 Difference]: With dead ends: 143 [2024-10-13 10:55:19,334 INFO L226 Difference]: Without dead ends: 143 [2024-10-13 10:55:19,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:55:19,334 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 1 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:19,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 280 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:55:19,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-10-13 10:55:19,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2024-10-13 10:55:19,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 107 states have (on average 1.4672897196261683) internal successors, (157), 141 states have internal predecessors, (157), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:19,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 163 transitions. [2024-10-13 10:55:19,339 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 163 transitions. Word has length 19 [2024-10-13 10:55:19,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:19,339 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 163 transitions. [2024-10-13 10:55:19,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:19,340 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 163 transitions. [2024-10-13 10:55:19,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-13 10:55:19,340 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:19,340 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-10-13 10:55:19,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 10:55:19,341 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-10-13 10:55:19,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:19,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1809377916, now seen corresponding path program 1 times [2024-10-13 10:55:19,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:19,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346897707] [2024-10-13 10:55:19,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:19,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:19,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:19,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:19,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:19,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346897707] [2024-10-13 10:55:19,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346897707] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:19,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:19,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:55:19,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417976522] [2024-10-13 10:55:19,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:19,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:55:19,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:19,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:55:19,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:55:19,438 INFO L87 Difference]: Start difference. First operand 143 states and 163 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:19,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:19,544 INFO L93 Difference]: Finished difference Result 142 states and 160 transitions. [2024-10-13 10:55:19,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:55:19,544 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-13 10:55:19,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:19,545 INFO L225 Difference]: With dead ends: 142 [2024-10-13 10:55:19,545 INFO L226 Difference]: Without dead ends: 142 [2024-10-13 10:55:19,545 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-10-13 10:55:19,546 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 14 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:19,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 212 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:55:19,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-13 10:55:19,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-10-13 10:55:19,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 107 states have (on average 1.4485981308411215) internal successors, (155), 140 states have internal predecessors, (155), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:19,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 160 transitions. [2024-10-13 10:55:19,554 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 160 transitions. Word has length 21 [2024-10-13 10:55:19,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:19,554 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 160 transitions. [2024-10-13 10:55:19,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:19,555 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 160 transitions. [2024-10-13 10:55:19,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-13 10:55:19,555 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:19,555 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:19,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 10:55:19,556 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-10-13 10:55:19,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:19,556 INFO L85 PathProgramCache]: Analyzing trace with hash 596696695, now seen corresponding path program 1 times [2024-10-13 10:55:19,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:19,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656511483] [2024-10-13 10:55:19,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:19,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:19,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:19,759 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:19,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:19,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656511483] [2024-10-13 10:55:19,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656511483] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:55:19,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678011642] [2024-10-13 10:55:19,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:19,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:55:19,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:55:19,763 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:55:19,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 10:55:19,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:19,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-13 10:55:19,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:55:19,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 10:55:19,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 10:55:20,029 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 19 treesize of output 18 [2024-10-13 10:55:20,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-13 10:55:20,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-13 10:55:20,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-13 10:55:20,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-10-13 10:55:20,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:20,337 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:55:20,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-13 10:55:20,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2024-10-13 10:55:20,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-13 10:55:20,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:55:20,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:20,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678011642] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:55:20,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:55:20,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 6] total 14 [2024-10-13 10:55:20,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572547462] [2024-10-13 10:55:20,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:55:20,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 10:55:20,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:20,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 10:55:20,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-10-13 10:55:20,766 INFO L87 Difference]: Start difference. First operand 142 states and 160 transitions. Second operand has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:21,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:21,269 INFO L93 Difference]: Finished difference Result 175 states and 202 transitions. [2024-10-13 10:55:21,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 10:55:21,269 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-13 10:55:21,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:21,270 INFO L225 Difference]: With dead ends: 175 [2024-10-13 10:55:21,270 INFO L226 Difference]: Without dead ends: 175 [2024-10-13 10:55:21,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2024-10-13 10:55:21,271 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 190 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:21,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 352 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 10:55:21,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-10-13 10:55:21,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 169. [2024-10-13 10:55:21,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 134 states have (on average 1.4477611940298507) internal successors, (194), 167 states have internal predecessors, (194), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:21,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 199 transitions. [2024-10-13 10:55:21,276 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 199 transitions. Word has length 21 [2024-10-13 10:55:21,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:21,276 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 199 transitions. [2024-10-13 10:55:21,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:21,277 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 199 transitions. [2024-10-13 10:55:21,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-13 10:55:21,277 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:21,277 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-10-13 10:55:21,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 10:55:21,482 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,SelfDestructingSolverStorable15 [2024-10-13 10:55:21,483 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-10-13 10:55:21,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:21,484 INFO L85 PathProgramCache]: Analyzing trace with hash 2046264024, now seen corresponding path program 1 times [2024-10-13 10:55:21,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:21,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011760186] [2024-10-13 10:55:21,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:21,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:21,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:21,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:21,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:21,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011760186] [2024-10-13 10:55:21,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011760186] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:21,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:21,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 10:55:21,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686311123] [2024-10-13 10:55:21,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:21,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:55:21,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:21,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:55:21,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:55:21,731 INFO L87 Difference]: Start difference. First operand 169 states and 199 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:21,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:21,922 INFO L93 Difference]: Finished difference Result 168 states and 198 transitions. [2024-10-13 10:55:21,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:55:21,922 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-13 10:55:21,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:21,923 INFO L225 Difference]: With dead ends: 168 [2024-10-13 10:55:21,923 INFO L226 Difference]: Without dead ends: 168 [2024-10-13 10:55:21,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:55:21,924 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 36 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:21,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 178 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:55:21,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-10-13 10:55:21,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2024-10-13 10:55:21,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 134 states have (on average 1.4402985074626866) internal successors, (193), 166 states have internal predecessors, (193), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:21,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 198 transitions. [2024-10-13 10:55:21,929 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 198 transitions. Word has length 21 [2024-10-13 10:55:21,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:21,929 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 198 transitions. [2024-10-13 10:55:21,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:21,929 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 198 transitions. [2024-10-13 10:55:21,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-13 10:55:21,930 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:21,930 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-10-13 10:55:21,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 10:55:21,930 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-10-13 10:55:21,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:21,931 INFO L85 PathProgramCache]: Analyzing trace with hash 2046264025, now seen corresponding path program 1 times [2024-10-13 10:55:21,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:21,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720952612] [2024-10-13 10:55:21,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:21,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:21,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:22,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:22,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:22,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720952612] [2024-10-13 10:55:22,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720952612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:22,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:22,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 10:55:22,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64509529] [2024-10-13 10:55:22,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:22,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:55:22,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:22,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:55:22,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:55:22,289 INFO L87 Difference]: Start difference. First operand 168 states and 198 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:22,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:22,599 INFO L93 Difference]: Finished difference Result 164 states and 194 transitions. [2024-10-13 10:55:22,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 10:55:22,600 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-13 10:55:22,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:22,601 INFO L225 Difference]: With dead ends: 164 [2024-10-13 10:55:22,601 INFO L226 Difference]: Without dead ends: 164 [2024-10-13 10:55:22,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-10-13 10:55:22,602 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 52 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:22,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 319 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:55:22,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-10-13 10:55:22,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 147. [2024-10-13 10:55:22,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 120 states have (on average 1.4083333333333334) internal successors, (169), 145 states have internal predecessors, (169), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:22,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 174 transitions. [2024-10-13 10:55:22,606 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 174 transitions. Word has length 21 [2024-10-13 10:55:22,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:22,606 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 174 transitions. [2024-10-13 10:55:22,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:22,607 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 174 transitions. [2024-10-13 10:55:22,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-13 10:55:22,607 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:22,607 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-10-13 10:55:22,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 10:55:22,608 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-10-13 10:55:22,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:22,608 INFO L85 PathProgramCache]: Analyzing trace with hash 944101404, now seen corresponding path program 1 times [2024-10-13 10:55:22,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:22,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782580348] [2024-10-13 10:55:22,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:22,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:22,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:22,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:22,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:22,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782580348] [2024-10-13 10:55:22,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782580348] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:22,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:22,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:55:22,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378507290] [2024-10-13 10:55:22,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:22,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:55:22,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:22,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:55:22,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:55:22,664 INFO L87 Difference]: Start difference. First operand 147 states and 174 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:22,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:22,791 INFO L93 Difference]: Finished difference Result 144 states and 169 transitions. [2024-10-13 10:55:22,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:55:22,792 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-13 10:55:22,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:22,793 INFO L225 Difference]: With dead ends: 144 [2024-10-13 10:55:22,793 INFO L226 Difference]: Without dead ends: 144 [2024-10-13 10:55:22,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:55:22,793 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 16 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:22,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 238 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:55:22,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-10-13 10:55:22,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-10-13 10:55:22,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 117 states have (on average 1.4017094017094016) internal successors, (164), 142 states have internal predecessors, (164), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:22,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 169 transitions. [2024-10-13 10:55:22,797 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 169 transitions. Word has length 23 [2024-10-13 10:55:22,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:22,797 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 169 transitions. [2024-10-13 10:55:22,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:22,798 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 169 transitions. [2024-10-13 10:55:22,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-13 10:55:22,798 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:22,798 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:22,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 10:55:22,799 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-10-13 10:55:22,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:22,799 INFO L85 PathProgramCache]: Analyzing trace with hash 603082545, now seen corresponding path program 1 times [2024-10-13 10:55:22,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:22,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697774138] [2024-10-13 10:55:22,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:22,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:22,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:22,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:22,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:22,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697774138] [2024-10-13 10:55:22,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697774138] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:22,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:22,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:55:22,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637615567] [2024-10-13 10:55:22,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:22,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:55:22,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:22,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:55:22,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:55:22,958 INFO L87 Difference]: Start difference. First operand 144 states and 169 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), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:23,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:23,069 INFO L93 Difference]: Finished difference Result 144 states and 168 transitions. [2024-10-13 10:55:23,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:55:23,069 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), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-10-13 10:55:23,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:23,070 INFO L225 Difference]: With dead ends: 144 [2024-10-13 10:55:23,070 INFO L226 Difference]: Without dead ends: 144 [2024-10-13 10:55:23,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-10-13 10:55:23,071 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 10 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 184 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-10-13 10:55:23,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 184 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:55:23,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-10-13 10:55:23,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2024-10-13 10:55:23,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 117 states have (on average 1.393162393162393) internal successors, (163), 141 states have internal predecessors, (163), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:23,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 167 transitions. [2024-10-13 10:55:23,075 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 167 transitions. Word has length 24 [2024-10-13 10:55:23,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:23,075 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 167 transitions. [2024-10-13 10:55:23,075 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), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:23,076 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 167 transitions. [2024-10-13 10:55:23,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 10:55:23,076 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:23,076 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-10-13 10:55:23,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 10:55:23,089 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-10-13 10:55:23,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:23,090 INFO L85 PathProgramCache]: Analyzing trace with hash -316730170, now seen corresponding path program 1 times [2024-10-13 10:55:23,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:23,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985700628] [2024-10-13 10:55:23,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:23,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:23,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:23,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:23,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:23,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985700628] [2024-10-13 10:55:23,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985700628] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:23,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:23,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 10:55:23,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985635841] [2024-10-13 10:55:23,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:23,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 10:55:23,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:23,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 10:55:23,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-13 10:55:23,358 INFO L87 Difference]: Start difference. First operand 143 states and 167 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:23,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:23,794 INFO L93 Difference]: Finished difference Result 163 states and 187 transitions. [2024-10-13 10:55:23,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 10:55:23,795 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-13 10:55:23,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:23,796 INFO L225 Difference]: With dead ends: 163 [2024-10-13 10:55:23,796 INFO L226 Difference]: Without dead ends: 163 [2024-10-13 10:55:23,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2024-10-13 10:55:23,797 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 130 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:23,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 306 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:55:23,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-13 10:55:23,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 150. [2024-10-13 10:55:23,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 124 states have (on average 1.3709677419354838) internal successors, (170), 148 states have internal predecessors, (170), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:23,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 174 transitions. [2024-10-13 10:55:23,802 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 174 transitions. Word has length 26 [2024-10-13 10:55:23,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:23,803 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 174 transitions. [2024-10-13 10:55:23,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:23,803 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 174 transitions. [2024-10-13 10:55:23,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 10:55:23,803 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:23,803 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-10-13 10:55:23,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-13 10:55:23,804 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-10-13 10:55:23,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:23,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1208357173, now seen corresponding path program 1 times [2024-10-13 10:55:23,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:23,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043872216] [2024-10-13 10:55:23,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:23,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:23,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:23,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:55:23,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:23,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043872216] [2024-10-13 10:55:23,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043872216] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:23,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:23,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:55:23,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688007118] [2024-10-13 10:55:23,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:23,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:55:23,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:23,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:55:23,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:55:23,848 INFO L87 Difference]: Start difference. First operand 150 states and 174 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:23,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:23,907 INFO L93 Difference]: Finished difference Result 152 states and 173 transitions. [2024-10-13 10:55:23,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:55:23,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-13 10:55:23,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:23,908 INFO L225 Difference]: With dead ends: 152 [2024-10-13 10:55:23,908 INFO L226 Difference]: Without dead ends: 152 [2024-10-13 10:55:23,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:55:23,909 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 46 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:23,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 95 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:55:23,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-10-13 10:55:23,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2024-10-13 10:55:23,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 126 states have (on average 1.3412698412698412) internal successors, (169), 150 states have internal predecessors, (169), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:23,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 173 transitions. [2024-10-13 10:55:23,913 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 173 transitions. Word has length 26 [2024-10-13 10:55:23,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:23,913 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 173 transitions. [2024-10-13 10:55:23,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:23,914 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 173 transitions. [2024-10-13 10:55:23,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-13 10:55:23,914 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:23,914 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-10-13 10:55:23,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-13 10:55:23,914 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-10-13 10:55:23,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:23,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1590083352, now seen corresponding path program 1 times [2024-10-13 10:55:23,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:23,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121596518] [2024-10-13 10:55:23,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:23,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:23,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:24,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:24,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:24,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121596518] [2024-10-13 10:55:24,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121596518] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:55:24,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579223741] [2024-10-13 10:55:24,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:24,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:55:24,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:55:24,037 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:55:24,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 10:55:24,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:24,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 10:55:24,172 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:55:24,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-13 10:55:24,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:55:24,217 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:55:24,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579223741] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:24,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 10:55:24,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2024-10-13 10:55:24,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203022445] [2024-10-13 10:55:24,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:24,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:55:24,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:24,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:55:24,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-13 10:55:24,219 INFO L87 Difference]: Start difference. First operand 152 states and 173 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:24,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:24,308 INFO L93 Difference]: Finished difference Result 147 states and 165 transitions. [2024-10-13 10:55:24,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:55:24,308 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-10-13 10:55:24,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:24,309 INFO L225 Difference]: With dead ends: 147 [2024-10-13 10:55:24,309 INFO L226 Difference]: Without dead ends: 147 [2024-10-13 10:55:24,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:55:24,310 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 4 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:24,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 214 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:55:24,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-10-13 10:55:24,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2024-10-13 10:55:24,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 120 states have (on average 1.3333333333333333) internal successors, (160), 144 states have internal predecessors, (160), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:24,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 164 transitions. [2024-10-13 10:55:24,314 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 164 transitions. Word has length 28 [2024-10-13 10:55:24,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:24,314 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 164 transitions. [2024-10-13 10:55:24,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:24,315 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 164 transitions. [2024-10-13 10:55:24,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-13 10:55:24,316 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:24,316 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:24,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 10:55:24,520 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,SelfDestructingSolverStorable22 [2024-10-13 10:55:24,521 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-10-13 10:55:24,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:24,521 INFO L85 PathProgramCache]: Analyzing trace with hash 434102536, now seen corresponding path program 1 times [2024-10-13 10:55:24,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:24,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902284806] [2024-10-13 10:55:24,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:24,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:24,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:24,682 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:24,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:24,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902284806] [2024-10-13 10:55:24,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902284806] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:55:24,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955076628] [2024-10-13 10:55:24,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:24,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:55:24,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:55:24,686 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:55:24,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 10:55:24,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:24,821 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-13 10:55:24,824 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:55:24,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 10:55:24,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 10:55:24,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-10-13 10:55:24,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-13 10:55:24,886 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:55:24,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2024-10-13 10:55:24,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-13 10:55:25,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-13 10:55:25,027 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:55:25,028 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 24 treesize of output 10 [2024-10-13 10:55:25,043 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:55:25,043 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:55:25,138 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:55:25,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955076628] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:55:25,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:55:25,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 8 [2024-10-13 10:55:25,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476118902] [2024-10-13 10:55:25,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:55:25,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:55:25,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:25,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:55:25,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:55:25,140 INFO L87 Difference]: Start difference. First operand 146 states and 164 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:25,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:25,524 INFO L93 Difference]: Finished difference Result 160 states and 182 transitions. [2024-10-13 10:55:25,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 10:55:25,525 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-10-13 10:55:25,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:25,526 INFO L225 Difference]: With dead ends: 160 [2024-10-13 10:55:25,526 INFO L226 Difference]: Without dead ends: 160 [2024-10-13 10:55:25,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-13 10:55:25,527 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 19 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:25,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 242 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:55:25,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-10-13 10:55:25,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 144. [2024-10-13 10:55:25,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 118 states have (on average 1.305084745762712) internal successors, (154), 142 states have internal predecessors, (154), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:25,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 158 transitions. [2024-10-13 10:55:25,533 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 158 transitions. Word has length 29 [2024-10-13 10:55:25,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:25,534 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 158 transitions. [2024-10-13 10:55:25,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:25,534 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 158 transitions. [2024-10-13 10:55:25,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-13 10:55:25,535 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:25,535 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:25,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-13 10:55:25,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:55:25,736 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-10-13 10:55:25,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:25,737 INFO L85 PathProgramCache]: Analyzing trace with hash 572276420, now seen corresponding path program 1 times [2024-10-13 10:55:25,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:25,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789069350] [2024-10-13 10:55:25,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:25,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:25,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:25,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 10:55:25,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:25,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789069350] [2024-10-13 10:55:25,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789069350] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:25,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:25,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 10:55:25,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511917104] [2024-10-13 10:55:25,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:25,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:55:25,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:25,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:55:25,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:55:25,799 INFO L87 Difference]: Start difference. First operand 144 states and 158 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:25,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:25,863 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2024-10-13 10:55:25,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:55:25,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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 30 [2024-10-13 10:55:25,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:25,865 INFO L225 Difference]: With dead ends: 143 [2024-10-13 10:55:25,865 INFO L226 Difference]: Without dead ends: 143 [2024-10-13 10:55:25,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:55:25,866 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 63 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:25,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 63 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:55:25,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-10-13 10:55:25,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2024-10-13 10:55:25,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 118 states have (on average 1.2881355932203389) internal successors, (152), 141 states have internal predecessors, (152), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:25,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 156 transitions. [2024-10-13 10:55:25,871 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 156 transitions. Word has length 30 [2024-10-13 10:55:25,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:25,871 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 156 transitions. [2024-10-13 10:55:25,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:25,872 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 156 transitions. [2024-10-13 10:55:25,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-13 10:55:25,872 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:25,872 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:25,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-13 10:55:25,873 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-10-13 10:55:25,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:25,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1313646286, now seen corresponding path program 1 times [2024-10-13 10:55:25,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:25,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542161608] [2024-10-13 10:55:25,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:25,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:25,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:26,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:26,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:26,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542161608] [2024-10-13 10:55:26,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542161608] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:26,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:26,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 10:55:26,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690326885] [2024-10-13 10:55:26,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:26,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 10:55:26,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:26,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 10:55:26,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:55:26,234 INFO L87 Difference]: Start difference. First operand 143 states and 156 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:26,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:26,586 INFO L93 Difference]: Finished difference Result 177 states and 191 transitions. [2024-10-13 10:55:26,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 10:55:26,587 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-10-13 10:55:26,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:26,587 INFO L225 Difference]: With dead ends: 177 [2024-10-13 10:55:26,587 INFO L226 Difference]: Without dead ends: 177 [2024-10-13 10:55:26,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2024-10-13 10:55:26,588 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 153 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:26,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 258 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:55:26,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-10-13 10:55:26,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 135. [2024-10-13 10:55:26,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 111 states have (on average 1.2972972972972974) internal successors, (144), 133 states have internal predecessors, (144), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:26,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2024-10-13 10:55:26,598 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 32 [2024-10-13 10:55:26,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:26,598 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2024-10-13 10:55:26,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:26,599 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2024-10-13 10:55:26,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-13 10:55:26,599 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:26,600 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:26,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-13 10:55:26,600 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr72ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-10-13 10:55:26,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:26,600 INFO L85 PathProgramCache]: Analyzing trace with hash 201836775, now seen corresponding path program 1 times [2024-10-13 10:55:26,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:26,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223399177] [2024-10-13 10:55:26,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:26,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:26,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:26,830 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:55:26,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:26,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223399177] [2024-10-13 10:55:26,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223399177] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:55:26,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277262396] [2024-10-13 10:55:26,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:26,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:55:26,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:55:26,832 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:55:26,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 10:55:26,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:26,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-13 10:55:26,983 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:55:27,017 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-13 10:55:27,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 27 [2024-10-13 10:55:27,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 29 [2024-10-13 10:55:27,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:55:27,375 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:55:27,645 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:55:27,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277262396] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:55:27,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:55:27,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2024-10-13 10:55:27,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284757238] [2024-10-13 10:55:27,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:55:27,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 10:55:27,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:27,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 10:55:27,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-10-13 10:55:27,647 INFO L87 Difference]: Start difference. First operand 135 states and 147 transitions. Second operand has 14 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:27,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:27,925 INFO L93 Difference]: Finished difference Result 144 states and 155 transitions. [2024-10-13 10:55:27,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:55:27,925 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-10-13 10:55:27,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:27,926 INFO L225 Difference]: With dead ends: 144 [2024-10-13 10:55:27,926 INFO L226 Difference]: Without dead ends: 121 [2024-10-13 10:55:27,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-10-13 10:55:27,927 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 12 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:27,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 218 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:55:27,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-13 10:55:27,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-10-13 10:55:27,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 97 states have (on average 1.3298969072164948) internal successors, (129), 119 states have internal predecessors, (129), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:27,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 132 transitions. [2024-10-13 10:55:27,930 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 132 transitions. Word has length 32 [2024-10-13 10:55:27,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:27,931 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 132 transitions. [2024-10-13 10:55:27,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:27,931 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 132 transitions. [2024-10-13 10:55:27,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-13 10:55:27,931 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:27,932 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:27,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-13 10:55:28,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-10-13 10:55:28,133 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-10-13 10:55:28,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:28,133 INFO L85 PathProgramCache]: Analyzing trace with hash -221680808, now seen corresponding path program 1 times [2024-10-13 10:55:28,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:28,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065377818] [2024-10-13 10:55:28,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:28,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:28,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:28,767 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:28,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:28,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065377818] [2024-10-13 10:55:28,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065377818] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:55:28,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110535320] [2024-10-13 10:55:28,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:28,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:55:28,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:55:28,769 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:55:28,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-13 10:55:28,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:28,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-13 10:55:28,920 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:55:28,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 10:55:28,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 10:55:28,997 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:55:28,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-13 10:55:29,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 10:55:29,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:55:29,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-13 10:55:29,141 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 10:55:29,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2024-10-13 10:55:29,148 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 24 treesize of output 11 [2024-10-13 10:55:29,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-10-13 10:55:29,192 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 16 treesize of output 11 [2024-10-13 10:55:29,208 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 16 treesize of output 11 [2024-10-13 10:55:29,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:29,289 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:55:29,415 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1624 (Array Int Int)) (v_ArrVal_1621 (Array Int Int)) (v_ArrVal_1620 (Array Int Int))) (= 1 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1620) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1621) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1624) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) is different from false [2024-10-13 10:55:29,422 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1624 (Array Int Int)) (v_ArrVal_1621 (Array Int Int)) (v_ArrVal_1620 (Array Int Int))) (= (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (store (store |c_#memory_int#1| .cse0 v_ArrVal_1620) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1621) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1624)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2024-10-13 10:55:29,432 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:55:29,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2024-10-13 10:55:29,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 62 [2024-10-13 10:55:29,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2024-10-13 10:55:29,469 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) (.cse3 (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |c_ULTIMATE.start_main_~end~0#1.base|))) (and (forall ((v_ArrVal_1617 Int) (v_ArrVal_1624 (Array Int Int)) (v_arrayElimCell_29 Int) (v_ArrVal_1620 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1617)))) (or (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1620) v_arrayElimCell_29 v_ArrVal_1624) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1624) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))) (or (forall ((v_ArrVal_1617 Int) (v_ArrVal_1624 (Array Int Int)) (v_arrayElimCell_29 Int) (v_ArrVal_1620 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1617)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1620) v_arrayElimCell_29 v_ArrVal_1624) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)) (not .cse3)) (or (forall ((v_ArrVal_1617 Int) (v_ArrVal_1624 (Array Int Int))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1617)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1624) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)) .cse3))) is different from false [2024-10-13 10:55:29,624 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:55:29,642 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:55:29,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 126 treesize of output 133 [2024-10-13 10:55:29,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 232 treesize of output 220 [2024-10-13 10:55:29,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-10-13 10:55:29,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-13 10:55:33,696 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:33,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110535320] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:55:33,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:55:33,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 12] total 30 [2024-10-13 10:55:33,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723887483] [2024-10-13 10:55:33,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:55:33,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-13 10:55:33,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:33,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-13 10:55:33,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=575, Unknown=12, NotChecked=156, Total=870 [2024-10-13 10:55:33,699 INFO L87 Difference]: Start difference. First operand 121 states and 132 transitions. Second operand has 30 states, 30 states have (on average 2.933333333333333) internal successors, (88), 30 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:35,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:35,156 INFO L93 Difference]: Finished difference Result 187 states and 207 transitions. [2024-10-13 10:55:35,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 10:55:35,156 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.933333333333333) internal successors, (88), 30 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-10-13 10:55:35,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:35,157 INFO L225 Difference]: With dead ends: 187 [2024-10-13 10:55:35,157 INFO L226 Difference]: Without dead ends: 187 [2024-10-13 10:55:35,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=403, Invalid=1318, Unknown=13, NotChecked=246, Total=1980 [2024-10-13 10:55:35,159 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 318 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 40 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 1466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 495 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:35,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 464 Invalid, 1466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 917 Invalid, 14 Unknown, 495 Unchecked, 0.8s Time] [2024-10-13 10:55:35,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-10-13 10:55:35,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 143. [2024-10-13 10:55:35,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 119 states have (on average 1.2857142857142858) internal successors, (153), 141 states have internal predecessors, (153), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:35,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 156 transitions. [2024-10-13 10:55:35,163 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 156 transitions. Word has length 34 [2024-10-13 10:55:35,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:35,163 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 156 transitions. [2024-10-13 10:55:35,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.933333333333333) internal successors, (88), 30 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:35,164 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 156 transitions. [2024-10-13 10:55:35,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-13 10:55:35,164 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:35,164 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] [2024-10-13 10:55:35,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-13 10:55:35,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-10-13 10:55:35,369 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-10-13 10:55:35,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:35,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1863293122, now seen corresponding path program 1 times [2024-10-13 10:55:35,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:35,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814486703] [2024-10-13 10:55:35,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:35,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:35,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:35,794 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:35,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:35,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814486703] [2024-10-13 10:55:35,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814486703] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:55:35,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573774648] [2024-10-13 10:55:35,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:35,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:55:35,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:55:35,797 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:55:35,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-13 10:55:35,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:35,960 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-13 10:55:35,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:55:35,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 10:55:36,045 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-13 10:55:36,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-13 10:55:36,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 10:55:36,178 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 10:55:36,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-10-13 10:55:36,236 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-13 10:55:36,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-10-13 10:55:36,268 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 10:55:36,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-10-13 10:55:36,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-13 10:55:36,492 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:36,493 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:55:36,799 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1762 (Array Int Int)) (v_ArrVal_1760 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_122| Int)) (or (< |v_ULTIMATE.start_main_~end~0#1.offset_122| 0) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1760))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1762)) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_122|)) 1) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_122|))) is different from false [2024-10-13 10:55:36,860 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:55:36,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2024-10-13 10:55:36,871 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:55:36,871 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 252 treesize of output 227 [2024-10-13 10:55:36,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 163 [2024-10-13 10:55:36,897 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:55:36,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 159 [2024-10-13 10:55:42,732 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:42,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573774648] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:55:42,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:55:42,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 11] total 30 [2024-10-13 10:55:42,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583694751] [2024-10-13 10:55:42,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:55:42,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-13 10:55:42,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:42,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-13 10:55:42,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=701, Unknown=19, NotChecked=56, Total=930 [2024-10-13 10:55:42,735 INFO L87 Difference]: Start difference. First operand 143 states and 156 transitions. Second operand has 31 states, 30 states have (on average 3.533333333333333) internal successors, (106), 31 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:43,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:43,815 INFO L93 Difference]: Finished difference Result 262 states and 292 transitions. [2024-10-13 10:55:43,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-13 10:55:43,815 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.533333333333333) internal successors, (106), 31 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-10-13 10:55:43,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:43,816 INFO L225 Difference]: With dead ends: 262 [2024-10-13 10:55:43,816 INFO L226 Difference]: Without dead ends: 262 [2024-10-13 10:55:43,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=251, Invalid=1066, Unknown=19, NotChecked=70, Total=1406 [2024-10-13 10:55:43,821 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 676 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 1130 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 220 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:43,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 478 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1130 Invalid, 0 Unknown, 220 Unchecked, 0.9s Time] [2024-10-13 10:55:43,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-10-13 10:55:43,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 172. [2024-10-13 10:55:43,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 148 states have (on average 1.2567567567567568) internal successors, (186), 170 states have internal predecessors, (186), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:43,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 189 transitions. [2024-10-13 10:55:43,826 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 189 transitions. Word has length 38 [2024-10-13 10:55:43,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:43,826 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 189 transitions. [2024-10-13 10:55:43,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.533333333333333) internal successors, (106), 31 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:43,828 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 189 transitions. [2024-10-13 10:55:43,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-13 10:55:43,828 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:43,828 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] [2024-10-13 10:55:43,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-13 10:55:44,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-10-13 10:55:44,033 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-10-13 10:55:44,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:44,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1863293121, now seen corresponding path program 1 times [2024-10-13 10:55:44,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:44,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495353275] [2024-10-13 10:55:44,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:44,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:44,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:44,534 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:44,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:44,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495353275] [2024-10-13 10:55:44,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495353275] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:55:44,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870773469] [2024-10-13 10:55:44,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:44,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:55:44,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:55:44,537 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:55:44,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-13 10:55:44,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:44,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-10-13 10:55:44,694 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:55:44,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 10:55:44,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-13 10:55:44,766 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:55:44,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-13 10:55:44,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 10:55:44,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 10:55:44,875 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 10:55:44,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-10-13 10:55:44,881 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 24 treesize of output 11 [2024-10-13 10:55:44,938 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-13 10:55:44,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-10-13 10:55:44,955 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-13 10:55:44,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-10-13 10:55:45,010 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 10:55:45,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-10-13 10:55:45,020 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 24 treesize of output 11 [2024-10-13 10:55:45,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-13 10:55:45,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-13 10:55:45,259 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:45,259 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:55:45,649 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_127| Int) (v_ArrVal_1904 (Array Int Int))) (or (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1904) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_127|) 9)) (< |v_ULTIMATE.start_main_~end~0#1.offset_127| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_127|))) (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_127| Int) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int))) (or (< (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1904) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_127|) 11) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1905) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_127|))) (< |v_ULTIMATE.start_main_~end~0#1.offset_127| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_127|)))) is different from false [2024-10-13 10:55:45,715 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_127| Int) (v_ArrVal_1904 (Array Int Int))) (or (< 0 (+ 9 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1904) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_127|))) (< |v_ULTIMATE.start_main_~end~0#1.offset_127| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_127|))) (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_127| Int) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~end~0#1.offset_127| 0) (< (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1904) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_127|) 11) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1905) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_127|))) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_127|))))) is different from false [2024-10-13 10:55:45,847 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (and (forall ((v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1899 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_127| Int) (v_ArrVal_1904 (Array Int Int))) (or (< 0 (+ 9 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1900) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1899) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1904) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_127|))) (< |v_ULTIMATE.start_main_~end~0#1.offset_127| 0) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_127|))) (forall ((v_ArrVal_1900 (Array Int Int)) (v_ArrVal_1899 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_127| Int) (v_ArrVal_1905 (Array Int Int)) (v_ArrVal_1904 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~end~0#1.offset_127| 0) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1899))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (< (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1900) .cse1 v_ArrVal_1904) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_127|) 11) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1905) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_127|))))) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_127|))))) is different from false [2024-10-13 10:55:45,864 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:55:45,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2024-10-13 10:55:45,874 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:55:45,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2024-10-13 10:55:45,888 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:55:45,888 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 632 treesize of output 567 [2024-10-13 10:55:45,917 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:55:45,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1127 treesize of output 1070 [2024-10-13 10:55:45,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 547 treesize of output 523 [2024-10-13 10:55:45,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 523 treesize of output 515 [2024-10-13 10:55:45,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 515 treesize of output 491 [2024-10-13 10:55:45,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:55:45,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 491 treesize of output 447 [2024-10-13 10:55:46,469 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:55:46,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2024-10-13 10:55:46,477 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:55:46,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2024-10-13 10:55:46,480 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:55:46,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2024-10-13 10:55:46,487 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:55:46,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:55:46,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:55:46,493 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 18 treesize of output 10 [2024-10-13 10:55:46,676 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:46,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870773469] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:55:46,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:55:46,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 11] total 31 [2024-10-13 10:55:46,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491401523] [2024-10-13 10:55:46,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:55:46,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-13 10:55:46,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:46,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-13 10:55:46,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=709, Unknown=12, NotChecked=168, Total=992 [2024-10-13 10:55:46,678 INFO L87 Difference]: Start difference. First operand 172 states and 189 transitions. Second operand has 32 states, 31 states have (on average 3.4838709677419355) internal successors, (108), 32 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:47,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:47,827 INFO L93 Difference]: Finished difference Result 224 states and 248 transitions. [2024-10-13 10:55:47,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-13 10:55:47,827 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.4838709677419355) internal successors, (108), 32 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-10-13 10:55:47,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:47,828 INFO L225 Difference]: With dead ends: 224 [2024-10-13 10:55:47,828 INFO L226 Difference]: Without dead ends: 224 [2024-10-13 10:55:47,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=280, Invalid=1360, Unknown=12, NotChecked=240, Total=1892 [2024-10-13 10:55:47,830 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 537 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 1300 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 1933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 560 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:47,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [537 Valid, 579 Invalid, 1933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1300 Invalid, 0 Unknown, 560 Unchecked, 0.8s Time] [2024-10-13 10:55:47,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-10-13 10:55:47,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 197. [2024-10-13 10:55:47,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 173 states have (on average 1.2947976878612717) internal successors, (224), 195 states have internal predecessors, (224), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:47,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 227 transitions. [2024-10-13 10:55:47,835 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 227 transitions. Word has length 38 [2024-10-13 10:55:47,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:47,835 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 227 transitions. [2024-10-13 10:55:47,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.4838709677419355) internal successors, (108), 32 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:47,835 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 227 transitions. [2024-10-13 10:55:47,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-13 10:55:47,836 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:47,836 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:47,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-13 10:55:48,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:55:48,037 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 71 more)] === [2024-10-13 10:55:48,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:48,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1648852028, now seen corresponding path program 1 times [2024-10-13 10:55:48,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:48,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168857259] [2024-10-13 10:55:48,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:48,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:48,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:49,050 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:49,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:49,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168857259] [2024-10-13 10:55:49,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168857259] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:55:49,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548299420] [2024-10-13 10:55:49,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:49,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:55:49,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:55:49,052 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:55:49,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-13 10:55:49,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:49,222 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-10-13 10:55:49,226 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:55:49,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 10:55:49,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 10:55:49,300 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-13 10:55:49,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-13 10:55:49,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 10:55:49,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:55:49,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-13 10:55:49,451 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 10:55:49,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-10-13 10:55:49,460 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 24 treesize of output 11 [2024-10-13 10:55:49,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-13 10:55:49,510 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 16 treesize of output 11 [2024-10-13 10:55:49,545 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-13 10:55:49,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-10-13 10:55:49,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-13 10:55:49,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-13 10:55:49,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 10:55:49,648 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 10:55:49,649 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 44 [2024-10-13 10:55:49,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-10-13 10:55:49,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-10-13 10:55:49,699 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 16 treesize of output 11 [2024-10-13 10:55:49,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-13 10:55:49,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:49,772 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:55:49,924 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2106 (Array Int Int)) (v_ArrVal_2104 (Array Int Int)) (v_ArrVal_2103 (Array Int Int))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_2104) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_2103) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_2106) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) 1)) is different from false [2024-10-13 10:55:49,979 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:55:49,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2024-10-13 10:55:49,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2024-10-13 10:55:49,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2024-10-13 10:55:50,011 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) (.cse1 (= |c_ULTIMATE.start_main_#t~malloc8#1.base| |c_ULTIMATE.start_main_~end~0#1.base|))) (and (or (forall ((v_ArrVal_2106 (Array Int Int)) (v_ArrVal_2102 (Array Int Int))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2102) |c_ULTIMATE.start_main_#t~malloc8#1.base| v_ArrVal_2106) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1)) .cse1) (forall ((v_ArrVal_2106 (Array Int Int)) (v_ArrVal_2102 (Array Int Int))) (let ((.cse2 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2102))) (or (= (select (select (store .cse2 |c_ULTIMATE.start_main_#t~malloc8#1.base| v_ArrVal_2106) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0) 1) (forall ((v_arrayElimCell_83 Int) (v_ArrVal_2104 (Array Int Int))) (= 1 (select (select (store (store .cse2 |c_ULTIMATE.start_main_#t~malloc8#1.base| v_ArrVal_2104) v_arrayElimCell_83 v_ArrVal_2106) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0)))))) (or (forall ((v_arrayElimCell_83 Int) (v_ArrVal_2106 (Array Int Int)) (v_ArrVal_2104 (Array Int Int)) (v_ArrVal_2102 (Array Int Int))) (= 1 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_2102) |c_ULTIMATE.start_main_#t~malloc8#1.base| v_ArrVal_2104) v_arrayElimCell_83 v_ArrVal_2106) |c_ULTIMATE.start_main_~list~0#1.base|) .cse0))) (not .cse1)))) is different from false [2024-10-13 10:55:50,225 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_17| Int) (v_ArrVal_2098 (Array Int Int)) (v_ArrVal_2096 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc8#1.base_17|) 0)) (forall ((v_ArrVal_2106 (Array Int Int)) (v_ArrVal_2102 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_2098) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_2096) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_2102))) (or (forall ((v_arrayElimCell_83 Int) (v_ArrVal_2104 (Array Int Int))) (= (select (select (store (store .cse0 |v_ULTIMATE.start_main_#t~malloc8#1.base_17| v_ArrVal_2104) v_arrayElimCell_83 v_ArrVal_2106) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)) (= (select (select (store .cse0 |v_ULTIMATE.start_main_#t~malloc8#1.base_17| v_ArrVal_2106) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))))) (forall ((v_ArrVal_2098 (Array Int Int)) (v_ArrVal_2096 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_2096) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (not (= (select |c_#valid| .cse2) 0)) (forall ((v_arrayElimCell_83 Int) (v_ArrVal_2106 (Array Int Int)) (v_ArrVal_2104 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_2098) .cse2 v_ArrVal_2104) v_arrayElimCell_83 v_ArrVal_2106) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1))))) (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_17| Int) (v_ArrVal_2098 (Array Int Int)) (v_ArrVal_2096 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_2096) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc8#1.base_17|) 0)) (forall ((v_ArrVal_2106 (Array Int Int)) (v_ArrVal_2102 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_2098) .cse3 v_ArrVal_2102) |v_ULTIMATE.start_main_#t~malloc8#1.base_17| v_ArrVal_2106) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)) (= .cse3 |v_ULTIMATE.start_main_#t~malloc8#1.base_17|)))))) is different from false [2024-10-13 10:55:50,262 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_17| Int) (v_ArrVal_2098 (Array Int Int)) (v_ArrVal_2096 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc8#1.base_17|) 0)) (forall ((v_ArrVal_2106 (Array Int Int)) (v_ArrVal_2102 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int#1| .cse2 v_ArrVal_2098) (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_2096) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_2102))) (or (forall ((v_arrayElimCell_83 Int) (v_ArrVal_2104 (Array Int Int))) (= (select (select (store (store .cse0 |v_ULTIMATE.start_main_#t~malloc8#1.base_17| v_ArrVal_2104) v_arrayElimCell_83 v_ArrVal_2106) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)) (= (select (select (store .cse0 |v_ULTIMATE.start_main_#t~malloc8#1.base_17| v_ArrVal_2106) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)))))) (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_17| Int) (v_ArrVal_2098 (Array Int Int)) (v_ArrVal_2096 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_2096) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc8#1.base_17|) 0)) (forall ((v_ArrVal_2106 (Array Int Int)) (v_ArrVal_2102 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int#1| .cse2 v_ArrVal_2098) .cse3 v_ArrVal_2102) |v_ULTIMATE.start_main_#t~malloc8#1.base_17| v_ArrVal_2106) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)) (= .cse3 |v_ULTIMATE.start_main_#t~malloc8#1.base_17|)))) (forall ((v_ArrVal_2098 (Array Int Int)) (v_ArrVal_2096 (Array Int Int))) (let ((.cse4 (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_2096) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (forall ((v_arrayElimCell_83 Int) (v_ArrVal_2106 (Array Int Int)) (v_ArrVal_2104 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int#1| .cse2 v_ArrVal_2098) .cse4 v_ArrVal_2104) v_arrayElimCell_83 v_ArrVal_2106) |c_ULTIMATE.start_main_~list~0#1.base|) .cse1) 1)) (not (= (select |c_#valid| .cse4) 0))))))) is different from false [2024-10-13 10:55:50,285 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:55:50,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 52 [2024-10-13 10:55:50,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 85 [2024-10-13 10:55:50,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2024-10-13 10:55:50,484 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:55:50,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 78 [2024-10-13 10:55:50,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 137 [2024-10-13 10:55:50,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 64 [2024-10-13 10:55:50,716 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:55:50,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 55 [2024-10-13 10:55:50,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 92 [2024-10-13 10:55:50,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 53 [2024-10-13 10:56:13,057 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:56:13,252 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:56:13,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 4112 treesize of output 4200 [2024-10-13 10:56:13,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1304 treesize of output 1288 [2024-10-13 10:56:13,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1288 treesize of output 1284 [2024-10-13 10:56:13,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1284 treesize of output 1280 [2024-10-13 10:56:13,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1280 treesize of output 1272 [2024-10-13 10:56:13,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1272 treesize of output 1264 [2024-10-13 10:56:13,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1264 treesize of output 1256 [2024-10-13 10:56:13,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1256 treesize of output 1248 [2024-10-13 10:56:13,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1248 treesize of output 1224 [2024-10-13 10:56:13,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1224 treesize of output 1216 [2024-10-13 10:56:13,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1216 treesize of output 1212 [2024-10-13 10:56:13,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1212 treesize of output 1204 [2024-10-13 10:56:14,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1210 treesize of output 1206 [2024-10-13 10:56:14,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 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 4304 treesize of output 4267 [2024-10-13 10:56:14,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-10-13 10:56:14,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1670 treesize of output 1658 [2024-10-13 10:56:14,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1658 treesize of output 1654 [2024-10-13 10:56:14,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1654 treesize of output 1650 [2024-10-13 10:56:14,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1650 treesize of output 1642 [2024-10-13 10:56:14,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1642 treesize of output 1634 [2024-10-13 10:56:14,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 71488 treesize of output 71463 [2024-10-13 10:56:14,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1922 treesize of output 1910 [2024-10-13 10:56:14,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1910 treesize of output 1906 [2024-10-13 10:56:14,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1906 treesize of output 1898 [2024-10-13 10:56:15,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1898 treesize of output 1874 [2024-10-13 10:56:15,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1874 treesize of output 1866 [2024-10-13 10:56:15,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1866 treesize of output 1850 [2024-10-13 10:56:15,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1850 treesize of output 1846 [2024-10-13 10:56:15,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1846 treesize of output 1838 [2024-10-13 10:56:15,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1838 treesize of output 1834 [2024-10-13 10:56:15,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1834 treesize of output 1830 [2024-10-13 10:56:15,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1830 treesize of output 1818 [2024-10-13 10:56:15,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1818 treesize of output 1802 [2024-10-13 10:56:15,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1802 treesize of output 1762 [2024-10-13 10:56:15,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1762 treesize of output 1722 [2024-10-13 10:56:15,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1722 treesize of output 1710 [2024-10-13 10:56:15,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1710 treesize of output 1702 [2024-10-13 10:56:15,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1702 treesize of output 1674 [2024-10-13 10:56:15,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1674 treesize of output 1666 [2024-10-13 10:56:15,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1666 treesize of output 1642 [2024-10-13 10:56:15,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1642 treesize of output 1638 [2024-10-13 10:56:15,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1638 treesize of output 1634 [2024-10-13 10:56:15,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1634 treesize of output 1626 [2024-10-13 10:56:15,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1998 treesize of output 1968 [2024-10-13 10:56:16,156 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-10-13 10:56:16,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2024-10-13 10:56:16,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2024-10-13 10:56:16,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2024-10-13 10:56:16,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-10-13 10:56:16,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-10-13 10:56:16,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-10-13 10:56:16,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-10-13 10:56:16,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-10-13 10:56:21,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:56:21,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548299420] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:56:21,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:56:21,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 18] total 46 [2024-10-13 10:56:21,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293884859] [2024-10-13 10:56:21,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:56:21,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-10-13 10:56:21,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:56:21,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-10-13 10:56:21,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=1425, Unknown=32, NotChecked=332, Total=2070 [2024-10-13 10:56:21,137 INFO L87 Difference]: Start difference. First operand 197 states and 227 transitions. Second operand has 46 states, 46 states have (on average 2.3043478260869565) internal successors, (106), 46 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)