./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/sll-circular-1.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/sll-circular-1.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 6c54160550402a2cf6139371c972b70bfa4a53acf207c90f67eed3e784812b38 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:55:47,713 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:55:47,769 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:47,772 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:55:47,777 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:55:47,804 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:55:47,805 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:55:47,806 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:55:47,806 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:55:47,807 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:55:47,807 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:55:47,807 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:55:47,808 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:55:47,809 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:55:47,810 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:55:47,810 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:55:47,810 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:55:47,811 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:55:47,811 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:55:47,811 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:55:47,811 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:55:47,812 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:55:47,812 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 10:55:47,812 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:55:47,813 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:55:47,813 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:55:47,813 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:55:47,813 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:55:47,814 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:55:47,814 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:55:47,814 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:55:47,814 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:55:47,815 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:55:47,815 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:55:47,815 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:55:47,815 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:55:47,816 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 10:55:47,816 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 10:55:47,816 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:55:47,816 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:55:47,817 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:55:47,817 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:55:47,817 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 -> 6c54160550402a2cf6139371c972b70bfa4a53acf207c90f67eed3e784812b38 [2024-10-13 10:55:48,073 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:55:48,099 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:55:48,104 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:55:48,105 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:55:48,106 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:55:48,108 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-1.i [2024-10-13 10:55:49,434 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:55:49,653 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:55:49,654 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-1.i [2024-10-13 10:55:49,669 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51b76b132/6f0664ff9b354a63a2d5d7bf7fda7f7b/FLAGb2bc1e971 [2024-10-13 10:55:49,996 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51b76b132/6f0664ff9b354a63a2d5d7bf7fda7f7b [2024-10-13 10:55:49,998 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:55:49,999 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:55:50,005 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:55:50,005 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:55:50,011 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:55:50,012 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:55:49" (1/1) ... [2024-10-13 10:55:50,012 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73a51284 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:50, skipping insertion in model container [2024-10-13 10:55:50,013 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:55:49" (1/1) ... [2024-10-13 10:55:50,054 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:55:50,281 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:55:50,290 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 10:55:50,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:55:50,347 INFO L204 MainTranslator]: Completed translation [2024-10-13 10:55:50,348 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:50 WrapperNode [2024-10-13 10:55:50,348 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:55:50,349 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 10:55:50,350 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 10:55:50,350 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 10:55:50,355 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:50" (1/1) ... [2024-10-13 10:55:50,365 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:50" (1/1) ... [2024-10-13 10:55:50,389 INFO L138 Inliner]: procedures = 119, calls = 31, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 120 [2024-10-13 10:55:50,389 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 10:55:50,392 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 10:55:50,392 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 10:55:50,392 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 10:55:50,400 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:50" (1/1) ... [2024-10-13 10:55:50,400 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:50" (1/1) ... [2024-10-13 10:55:50,402 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:50" (1/1) ... [2024-10-13 10:55:50,417 INFO L175 MemorySlicer]: Split 20 memory accesses to 2 slices as follows [2, 18]. 90 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 6 writes are split as follows [0, 6]. [2024-10-13 10:55:50,418 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:50" (1/1) ... [2024-10-13 10:55:50,418 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:50" (1/1) ... [2024-10-13 10:55:50,447 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:50" (1/1) ... [2024-10-13 10:55:50,450 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:50" (1/1) ... [2024-10-13 10:55:50,452 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:50" (1/1) ... [2024-10-13 10:55:50,456 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:50" (1/1) ... [2024-10-13 10:55:50,458 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 10:55:50,459 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 10:55:50,459 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 10:55:50,459 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 10:55:50,460 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:50" (1/1) ... [2024-10-13 10:55:50,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:55:50,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:55:50,505 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:50,508 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:50,552 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-13 10:55:50,552 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-13 10:55:50,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 10:55:50,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 10:55:50,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 10:55:50,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 10:55:50,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 10:55:50,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 10:55:50,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 10:55:50,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 10:55:50,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 10:55:50,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 10:55:50,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 10:55:50,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 10:55:50,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 10:55:50,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 10:55:50,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 10:55:50,641 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 10:55:50,643 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 10:55:50,918 INFO L? ?]: Removed 89 outVars from TransFormulas that were not future-live. [2024-10-13 10:55:50,918 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 10:55:50,954 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 10:55:50,955 INFO L314 CfgBuilder]: Removed 9 assume(true) statements. [2024-10-13 10:55:50,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:55:50 BoogieIcfgContainer [2024-10-13 10:55:50,955 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 10:55:50,957 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 10:55:50,958 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 10:55:50,960 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 10:55:50,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:55:49" (1/3) ... [2024-10-13 10:55:50,962 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40f481e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:55:50, skipping insertion in model container [2024-10-13 10:55:50,962 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:55:50" (2/3) ... [2024-10-13 10:55:50,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40f481e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:55:50, skipping insertion in model container [2024-10-13 10:55:50,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:55:50" (3/3) ... [2024-10-13 10:55:50,966 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-circular-1.i [2024-10-13 10:55:50,979 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 10:55:50,980 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2024-10-13 10:55:51,020 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 10:55:51,025 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;@56ba43be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 10:55:51,026 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2024-10-13 10:55:51,029 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 46 states have (on average 2.391304347826087) internal successors, (110), 90 states have internal predecessors, (110), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 10:55:51,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-13 10:55:51,035 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:51,035 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-13 10:55:51,036 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-13 10:55:51,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:51,041 INFO L85 PathProgramCache]: Analyzing trace with hash 7639, now seen corresponding path program 1 times [2024-10-13 10:55:51,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:51,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937714952] [2024-10-13 10:55:51,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:51,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:51,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:51,240 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:51,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:51,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937714952] [2024-10-13 10:55:51,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937714952] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:51,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:51,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 10:55:51,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306191026] [2024-10-13 10:55:51,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:51,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:55:51,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:51,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:55:51,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:55:51,328 INFO L87 Difference]: Start difference. First operand has 95 states, 46 states have (on average 2.391304347826087) internal successors, (110), 90 states have internal predecessors, (110), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 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:51,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:51,438 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2024-10-13 10:55:51,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:55:51,441 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:51,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:51,446 INFO L225 Difference]: With dead ends: 86 [2024-10-13 10:55:51,447 INFO L226 Difference]: Without dead ends: 85 [2024-10-13 10:55:51,448 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:51,451 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 60 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:51,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 69 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:55:51,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-13 10:55:51,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-10-13 10:55:51,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 42 states have (on average 2.142857142857143) internal successors, (90), 83 states have internal predecessors, (90), 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:51,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 93 transitions. [2024-10-13 10:55:51,487 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 93 transitions. Word has length 2 [2024-10-13 10:55:51,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:51,487 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 93 transitions. [2024-10-13 10:55:51,488 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:51,489 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2024-10-13 10:55:51,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-13 10:55:51,489 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:51,489 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-13 10:55:51,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 10:55:51,489 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-13 10:55:51,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:51,490 INFO L85 PathProgramCache]: Analyzing trace with hash 7640, now seen corresponding path program 1 times [2024-10-13 10:55:51,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:51,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440806357] [2024-10-13 10:55:51,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:51,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:51,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:51,589 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:51,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:51,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440806357] [2024-10-13 10:55:51,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440806357] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:51,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:51,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 10:55:51,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511603744] [2024-10-13 10:55:51,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:51,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:55:51,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:51,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:55:51,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:55:51,594 INFO L87 Difference]: Start difference. First operand 85 states and 93 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:51,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:51,667 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2024-10-13 10:55:51,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:55:51,667 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:51,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:51,668 INFO L225 Difference]: With dead ends: 81 [2024-10-13 10:55:51,669 INFO L226 Difference]: Without dead ends: 81 [2024-10-13 10:55:51,669 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:51,670 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 60 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:51,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 70 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:55:51,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-13 10:55:51,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-10-13 10:55:51,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 42 states have (on average 2.0476190476190474) internal successors, (86), 79 states have internal predecessors, (86), 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:51,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2024-10-13 10:55:51,679 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 2 [2024-10-13 10:55:51,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:51,679 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2024-10-13 10:55:51,680 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:51,680 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2024-10-13 10:55:51,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-13 10:55:51,680 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:51,681 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 10:55:51,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 10:55:51,681 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-13 10:55:51,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:51,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1529682928, now seen corresponding path program 1 times [2024-10-13 10:55:51,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:51,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173315743] [2024-10-13 10:55:51,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:51,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:51,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:51,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:51,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:51,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173315743] [2024-10-13 10:55:51,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173315743] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:51,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:51,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:55:51,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690303169] [2024-10-13 10:55:51,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:51,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:55:51,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:51,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:55:51,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:55:51,747 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:51,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:51,849 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2024-10-13 10:55:51,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:55:51,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-13 10:55:51,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:51,851 INFO L225 Difference]: With dead ends: 70 [2024-10-13 10:55:51,851 INFO L226 Difference]: Without dead ends: 70 [2024-10-13 10:55:51,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:51,852 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 88 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:51,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 48 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:55:51,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-13 10:55:51,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-10-13 10:55:51,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 42 states have (on average 1.7857142857142858) internal successors, (75), 68 states have internal predecessors, (75), 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:51,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2024-10-13 10:55:51,856 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 6 [2024-10-13 10:55:51,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:51,856 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2024-10-13 10:55:51,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:51,857 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2024-10-13 10:55:51,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-13 10:55:51,857 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:51,857 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 10:55:51,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 10:55:51,857 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-13 10:55:51,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:51,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1529682927, now seen corresponding path program 1 times [2024-10-13 10:55:51,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:51,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441529390] [2024-10-13 10:55:51,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:51,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:51,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:51,969 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:51,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:51,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441529390] [2024-10-13 10:55:51,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441529390] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:51,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:51,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:55:51,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720177464] [2024-10-13 10:55:51,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:51,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:55:51,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:51,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:55:51,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:55:51,972 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:52,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:52,061 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2024-10-13 10:55:52,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:55:52,061 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-13 10:55:52,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:52,062 INFO L225 Difference]: With dead ends: 75 [2024-10-13 10:55:52,062 INFO L226 Difference]: Without dead ends: 75 [2024-10-13 10:55:52,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:52,063 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 57 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:52,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 85 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:55:52,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-13 10:55:52,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-10-13 10:55:52,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 47 states have (on average 1.7234042553191489) internal successors, (81), 73 states have internal predecessors, (81), 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:52,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2024-10-13 10:55:52,067 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 6 [2024-10-13 10:55:52,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:52,068 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2024-10-13 10:55:52,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:52,068 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2024-10-13 10:55:52,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-13 10:55:52,068 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:52,068 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:52,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 10:55:52,069 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-13 10:55:52,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:52,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1146284323, now seen corresponding path program 1 times [2024-10-13 10:55:52,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:52,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857328312] [2024-10-13 10:55:52,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:52,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:52,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:52,186 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:52,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:52,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857328312] [2024-10-13 10:55:52,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857328312] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:52,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:52,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:55:52,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734476953] [2024-10-13 10:55:52,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:52,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:55:52,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:52,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:55:52,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:55:52,189 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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:52,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:52,297 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2024-10-13 10:55:52,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:55:52,298 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 8 [2024-10-13 10:55:52,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:52,298 INFO L225 Difference]: With dead ends: 74 [2024-10-13 10:55:52,299 INFO L226 Difference]: Without dead ends: 74 [2024-10-13 10:55:52,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:55:52,300 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 36 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:52,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 110 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:55:52,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-13 10:55:52,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-10-13 10:55:52,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 47 states have (on average 1.702127659574468) internal successors, (80), 72 states have internal predecessors, (80), 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:52,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2024-10-13 10:55:52,304 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 8 [2024-10-13 10:55:52,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:52,304 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2024-10-13 10:55:52,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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:52,305 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2024-10-13 10:55:52,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-13 10:55:52,305 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:52,305 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:52,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 10:55:52,305 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-13 10:55:52,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:52,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1146284322, now seen corresponding path program 1 times [2024-10-13 10:55:52,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:52,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271473620] [2024-10-13 10:55:52,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:52,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:52,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:52,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:52,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:52,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271473620] [2024-10-13 10:55:52,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271473620] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:52,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:52,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:55:52,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110591410] [2024-10-13 10:55:52,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:52,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:55:52,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:52,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:55:52,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:55:52,451 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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:52,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:52,593 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2024-10-13 10:55:52,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:55:52,594 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 8 [2024-10-13 10:55:52,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:52,595 INFO L225 Difference]: With dead ends: 69 [2024-10-13 10:55:52,595 INFO L226 Difference]: Without dead ends: 69 [2024-10-13 10:55:52,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:55:52,595 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 14 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:52,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 157 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:55:52,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-13 10:55:52,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 64. [2024-10-13 10:55:52,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 42 states have (on average 1.6428571428571428) internal successors, (69), 62 states have internal predecessors, (69), 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:52,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2024-10-13 10:55:52,605 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 8 [2024-10-13 10:55:52,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:52,605 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2024-10-13 10:55:52,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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:52,605 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2024-10-13 10:55:52,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 10:55:52,606 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:52,606 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:52,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 10:55:52,606 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-13 10:55:52,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:52,606 INFO L85 PathProgramCache]: Analyzing trace with hash 2046143368, now seen corresponding path program 1 times [2024-10-13 10:55:52,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:52,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315491916] [2024-10-13 10:55:52,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:52,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:52,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:52,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:52,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:52,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315491916] [2024-10-13 10:55:52,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315491916] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:52,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:52,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:55:52,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208084093] [2024-10-13 10:55:52,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:52,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:55:52,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:52,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:55:52,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:55:52,898 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 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:53,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:53,108 INFO L93 Difference]: Finished difference Result 96 states and 111 transitions. [2024-10-13 10:55:53,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:55:53,109 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 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:53,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:53,110 INFO L225 Difference]: With dead ends: 96 [2024-10-13 10:55:53,110 INFO L226 Difference]: Without dead ends: 96 [2024-10-13 10:55:53,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-13 10:55:53,111 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 143 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:53,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 152 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:55:53,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-13 10:55:53,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 87. [2024-10-13 10:55:53,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 65 states have (on average 1.6) internal successors, (104), 85 states have internal predecessors, (104), 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:53,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 107 transitions. [2024-10-13 10:55:53,116 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 107 transitions. Word has length 10 [2024-10-13 10:55:53,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:53,116 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 107 transitions. [2024-10-13 10:55:53,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 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:53,116 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 107 transitions. [2024-10-13 10:55:53,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 10:55:53,117 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:53,117 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:53,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 10:55:53,117 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-13 10:55:53,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:53,118 INFO L85 PathProgramCache]: Analyzing trace with hash 2046143367, now seen corresponding path program 1 times [2024-10-13 10:55:53,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:53,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690830951] [2024-10-13 10:55:53,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:53,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:53,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:53,240 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:53,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:53,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690830951] [2024-10-13 10:55:53,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690830951] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:53,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:53,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:55:53,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616652114] [2024-10-13 10:55:53,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:53,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:55:53,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:53,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:55:53,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:55:53,243 INFO L87 Difference]: Start difference. First operand 87 states and 107 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 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:53,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:53,416 INFO L93 Difference]: Finished difference Result 96 states and 110 transitions. [2024-10-13 10:55:53,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 10:55:53,416 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 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:53,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:53,417 INFO L225 Difference]: With dead ends: 96 [2024-10-13 10:55:53,417 INFO L226 Difference]: Without dead ends: 96 [2024-10-13 10:55:53,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:55:53,419 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 153 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:53,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 130 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:55:53,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-13 10:55:53,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 88. [2024-10-13 10:55:53,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 66 states have (on average 1.5757575757575757) internal successors, (104), 86 states have internal predecessors, (104), 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:53,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 107 transitions. [2024-10-13 10:55:53,430 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 107 transitions. Word has length 10 [2024-10-13 10:55:53,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:53,430 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 107 transitions. [2024-10-13 10:55:53,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 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:53,430 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2024-10-13 10:55:53,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-13 10:55:53,431 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:53,431 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:53,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 10:55:53,431 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-13 10:55:53,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:53,432 INFO L85 PathProgramCache]: Analyzing trace with hash -994086634, now seen corresponding path program 1 times [2024-10-13 10:55:53,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:53,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486161728] [2024-10-13 10:55:53,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:53,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:53,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:53,554 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:53,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:53,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486161728] [2024-10-13 10:55:53,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486161728] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:53,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:53,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 10:55:53,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596616384] [2024-10-13 10:55:53,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:53,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:55:53,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:53,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:55:53,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:55:53,559 INFO L87 Difference]: Start difference. First operand 88 states and 107 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 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:53,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:53,702 INFO L93 Difference]: Finished difference Result 114 states and 131 transitions. [2024-10-13 10:55:53,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 10:55:53,703 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 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 11 [2024-10-13 10:55:53,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:53,703 INFO L225 Difference]: With dead ends: 114 [2024-10-13 10:55:53,703 INFO L226 Difference]: Without dead ends: 114 [2024-10-13 10:55:53,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-13 10:55:53,705 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 186 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:53,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 182 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:55:53,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-13 10:55:53,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 88. [2024-10-13 10:55:53,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 66 states have (on average 1.5606060606060606) internal successors, (103), 86 states have internal predecessors, (103), 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:53,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 106 transitions. [2024-10-13 10:55:53,712 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 106 transitions. Word has length 11 [2024-10-13 10:55:53,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:53,712 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 106 transitions. [2024-10-13 10:55:53,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 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:53,712 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 106 transitions. [2024-10-13 10:55:53,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-13 10:55:53,713 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:53,713 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:53,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 10:55:53,713 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-13 10:55:53,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:53,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1813699309, now seen corresponding path program 1 times [2024-10-13 10:55:53,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:53,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631012486] [2024-10-13 10:55:53,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:53,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:53,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:53,937 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:53,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:53,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631012486] [2024-10-13 10:55:53,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631012486] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:53,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:53,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 10:55:53,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111063102] [2024-10-13 10:55:53,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:53,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:55:53,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:53,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:55:53,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:55:53,939 INFO L87 Difference]: Start difference. First operand 88 states and 106 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 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:54,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:54,121 INFO L93 Difference]: Finished difference Result 110 states and 126 transitions. [2024-10-13 10:55:54,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:55:54,124 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 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 13 [2024-10-13 10:55:54,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:54,125 INFO L225 Difference]: With dead ends: 110 [2024-10-13 10:55:54,125 INFO L226 Difference]: Without dead ends: 110 [2024-10-13 10:55:54,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:55:54,126 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 188 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:54,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 187 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:55:54,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-13 10:55:54,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 91. [2024-10-13 10:55:54,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 69 states have (on average 1.565217391304348) internal successors, (108), 89 states have internal predecessors, (108), 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:54,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 111 transitions. [2024-10-13 10:55:54,137 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 111 transitions. Word has length 13 [2024-10-13 10:55:54,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:54,137 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 111 transitions. [2024-10-13 10:55:54,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 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:54,137 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2024-10-13 10:55:54,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-13 10:55:54,140 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:54,140 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:54,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 10:55:54,140 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-13 10:55:54,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:54,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1813699308, now seen corresponding path program 1 times [2024-10-13 10:55:54,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:54,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206856682] [2024-10-13 10:55:54,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:54,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:54,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:54,537 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:54,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:54,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206856682] [2024-10-13 10:55:54,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206856682] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:54,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:54,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:55:54,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414730954] [2024-10-13 10:55:54,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:54,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:55:54,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:54,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:55:54,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:55:54,540 INFO L87 Difference]: Start difference. First operand 91 states and 111 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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:54,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:54,828 INFO L93 Difference]: Finished difference Result 109 states and 125 transitions. [2024-10-13 10:55:54,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 10:55:54,829 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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 13 [2024-10-13 10:55:54,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:54,829 INFO L225 Difference]: With dead ends: 109 [2024-10-13 10:55:54,829 INFO L226 Difference]: Without dead ends: 109 [2024-10-13 10:55:54,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:55:54,830 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 112 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:54,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 166 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:55:54,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-13 10:55:54,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 91. [2024-10-13 10:55:54,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 69 states have (on average 1.5507246376811594) internal successors, (107), 89 states have internal predecessors, (107), 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:54,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 110 transitions. [2024-10-13 10:55:54,833 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 110 transitions. Word has length 13 [2024-10-13 10:55:54,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:54,833 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 110 transitions. [2024-10-13 10:55:54,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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:54,834 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 110 transitions. [2024-10-13 10:55:54,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 10:55:54,834 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:54,834 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:54,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 10:55:54,835 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-13 10:55:54,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:54,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1646398563, now seen corresponding path program 1 times [2024-10-13 10:55:54,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:54,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082524554] [2024-10-13 10:55:54,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:54,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:54,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:54,915 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:54,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:54,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082524554] [2024-10-13 10:55:54,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082524554] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:54,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:54,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:55:54,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532100132] [2024-10-13 10:55:54,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:54,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:55:54,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:54,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:55:54,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:55:54,917 INFO L87 Difference]: Start difference. First operand 91 states and 110 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:55,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:55,019 INFO L93 Difference]: Finished difference Result 92 states and 110 transitions. [2024-10-13 10:55:55,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:55:55,019 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:55,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:55,020 INFO L225 Difference]: With dead ends: 92 [2024-10-13 10:55:55,020 INFO L226 Difference]: Without dead ends: 92 [2024-10-13 10:55:55,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:55:55,021 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 11 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:55,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 183 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:55:55,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-13 10:55:55,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2024-10-13 10:55:55,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 69 states have (on average 1.536231884057971) internal successors, (106), 88 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:55,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 108 transitions. [2024-10-13 10:55:55,025 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 108 transitions. Word has length 14 [2024-10-13 10:55:55,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:55,025 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 108 transitions. [2024-10-13 10:55:55,025 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:55,025 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 108 transitions. [2024-10-13 10:55:55,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-13 10:55:55,025 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:55,025 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:55,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 10:55:55,026 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-13 10:55:55,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:55,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1198187058, now seen corresponding path program 1 times [2024-10-13 10:55:55,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:55,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99979123] [2024-10-13 10:55:55,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:55,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:55,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:55,234 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:55,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:55,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99979123] [2024-10-13 10:55:55,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99979123] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:55,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:55,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:55:55,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830060600] [2024-10-13 10:55:55,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:55,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:55:55,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:55,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:55:55,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:55:55,236 INFO L87 Difference]: Start difference. First operand 90 states and 108 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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:55,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:55,480 INFO L93 Difference]: Finished difference Result 110 states and 125 transitions. [2024-10-13 10:55:55,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 10:55:55,480 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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 16 [2024-10-13 10:55:55,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:55,481 INFO L225 Difference]: With dead ends: 110 [2024-10-13 10:55:55,481 INFO L226 Difference]: Without dead ends: 110 [2024-10-13 10:55:55,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:55:55,482 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 109 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:55,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 193 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:55:55,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-13 10:55:55,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 91. [2024-10-13 10:55:55,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 70 states have (on average 1.5285714285714285) internal successors, (107), 89 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:55,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 109 transitions. [2024-10-13 10:55:55,485 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 109 transitions. Word has length 16 [2024-10-13 10:55:55,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:55,485 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 109 transitions. [2024-10-13 10:55:55,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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:55,485 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 109 transitions. [2024-10-13 10:55:55,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-13 10:55:55,485 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:55,486 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:55,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 10:55:55,486 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-13 10:55:55,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:55,486 INFO L85 PathProgramCache]: Analyzing trace with hash -305258640, now seen corresponding path program 1 times [2024-10-13 10:55:55,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:55,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28737174] [2024-10-13 10:55:55,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:55,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:55,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:55,524 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:55,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:55,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28737174] [2024-10-13 10:55:55,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28737174] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:55,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:55,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:55:55,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65770304] [2024-10-13 10:55:55,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:55,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:55:55,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:55,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:55:55,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:55:55,526 INFO L87 Difference]: Start difference. First operand 91 states and 109 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:55,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:55,583 INFO L93 Difference]: Finished difference Result 102 states and 122 transitions. [2024-10-13 10:55:55,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:55:55,583 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2024-10-13 10:55:55,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:55,584 INFO L225 Difference]: With dead ends: 102 [2024-10-13 10:55:55,584 INFO L226 Difference]: Without dead ends: 102 [2024-10-13 10:55:55,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:55:55,585 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 5 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:55,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 109 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:55:55,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-13 10:55:55,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2024-10-13 10:55:55,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 80 states have (on average 1.4875) internal successors, (119), 99 states have internal predecessors, (119), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:55,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 121 transitions. [2024-10-13 10:55:55,587 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 121 transitions. Word has length 16 [2024-10-13 10:55:55,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:55,588 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 121 transitions. [2024-10-13 10:55:55,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:55,588 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 121 transitions. [2024-10-13 10:55:55,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-13 10:55:55,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:55,588 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:55,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 10:55:55,588 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-13 10:55:55,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:55,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1510988429, now seen corresponding path program 1 times [2024-10-13 10:55:55,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:55,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103615181] [2024-10-13 10:55:55,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:55,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:55,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:55,798 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:55,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:55,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103615181] [2024-10-13 10:55:55,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103615181] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:55,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:55,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 10:55:55,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153214053] [2024-10-13 10:55:55,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:55,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:55:55,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:55,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:55:55,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:55:55,800 INFO L87 Difference]: Start difference. First operand 101 states and 121 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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:56,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:56,051 INFO L93 Difference]: Finished difference Result 121 states and 138 transitions. [2024-10-13 10:55:56,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:55:56,051 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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 17 [2024-10-13 10:55:56,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:56,052 INFO L225 Difference]: With dead ends: 121 [2024-10-13 10:55:56,052 INFO L226 Difference]: Without dead ends: 121 [2024-10-13 10:55:56,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2024-10-13 10:55:56,052 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 220 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:56,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 128 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:55:56,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-13 10:55:56,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 102. [2024-10-13 10:55:56,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 81 states have (on average 1.4814814814814814) internal successors, (120), 100 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:56,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 122 transitions. [2024-10-13 10:55:56,055 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 122 transitions. Word has length 17 [2024-10-13 10:55:56,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:56,056 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 122 transitions. [2024-10-13 10:55:56,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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:56,056 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 122 transitions. [2024-10-13 10:55:56,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-13 10:55:56,057 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:56,057 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:56,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 10:55:56,057 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-13 10:55:56,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:56,057 INFO L85 PathProgramCache]: Analyzing trace with hash -77510989, now seen corresponding path program 1 times [2024-10-13 10:55:56,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:56,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961809547] [2024-10-13 10:55:56,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:56,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:56,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:56,079 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:56,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:56,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961809547] [2024-10-13 10:55:56,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961809547] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:56,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:56,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:55:56,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460576540] [2024-10-13 10:55:56,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:56,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:55:56,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:56,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:55:56,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:55:56,081 INFO L87 Difference]: Start difference. First operand 102 states and 122 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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:56,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:56,116 INFO L93 Difference]: Finished difference Result 104 states and 124 transitions. [2024-10-13 10:55:56,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:55:56,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 18 [2024-10-13 10:55:56,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:56,116 INFO L225 Difference]: With dead ends: 104 [2024-10-13 10:55:56,116 INFO L226 Difference]: Without dead ends: 104 [2024-10-13 10:55:56,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:55:56,117 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:56,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:55:56,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-13 10:55:56,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-10-13 10:55:56,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 83 states have (on average 1.4698795180722892) internal successors, (122), 102 states have internal predecessors, (122), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:56,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 124 transitions. [2024-10-13 10:55:56,119 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 124 transitions. Word has length 18 [2024-10-13 10:55:56,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:56,120 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 124 transitions. [2024-10-13 10:55:56,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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:56,120 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 124 transitions. [2024-10-13 10:55:56,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-13 10:55:56,120 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:56,120 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:56,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 10:55:56,121 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-13 10:55:56,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:56,121 INFO L85 PathProgramCache]: Analyzing trace with hash 690281268, now seen corresponding path program 1 times [2024-10-13 10:55:56,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:56,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533559466] [2024-10-13 10:55:56,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:56,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:56,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:56,478 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:56,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:56,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533559466] [2024-10-13 10:55:56,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533559466] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:56,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:56,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 10:55:56,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179921728] [2024-10-13 10:55:56,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:56,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:55:56,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:56,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:55:56,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:55:56,480 INFO L87 Difference]: Start difference. First operand 104 states and 124 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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:56,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:56,648 INFO L93 Difference]: Finished difference Result 122 states and 139 transitions. [2024-10-13 10:55:56,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:55:56,649 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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 17 [2024-10-13 10:55:56,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:56,649 INFO L225 Difference]: With dead ends: 122 [2024-10-13 10:55:56,649 INFO L226 Difference]: Without dead ends: 122 [2024-10-13 10:55:56,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:55:56,650 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 192 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:56,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 168 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:55:56,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-13 10:55:56,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 108. [2024-10-13 10:55:56,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 87 states have (on average 1.471264367816092) internal successors, (128), 106 states have internal predecessors, (128), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:56,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 130 transitions. [2024-10-13 10:55:56,652 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 130 transitions. Word has length 17 [2024-10-13 10:55:56,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:56,653 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 130 transitions. [2024-10-13 10:55:56,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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:56,653 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 130 transitions. [2024-10-13 10:55:56,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-13 10:55:56,655 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:56,655 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:56,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 10:55:56,656 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-13 10:55:56,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:56,656 INFO L85 PathProgramCache]: Analyzing trace with hash 690281269, now seen corresponding path program 1 times [2024-10-13 10:55:56,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:56,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588904740] [2024-10-13 10:55:56,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:56,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:56,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:56,890 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:56,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:56,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588904740] [2024-10-13 10:55:56,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588904740] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:56,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:56,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:55:56,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083065581] [2024-10-13 10:55:56,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:56,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:55:56,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:56,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:55:56,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:55:56,892 INFO L87 Difference]: Start difference. First operand 108 states and 130 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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:57,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:57,058 INFO L93 Difference]: Finished difference Result 121 states and 138 transitions. [2024-10-13 10:55:57,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 10:55:57,058 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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 17 [2024-10-13 10:55:57,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:57,059 INFO L225 Difference]: With dead ends: 121 [2024-10-13 10:55:57,059 INFO L226 Difference]: Without dead ends: 121 [2024-10-13 10:55:57,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:55:57,059 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 121 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:57,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 144 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:55:57,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-13 10:55:57,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 108. [2024-10-13 10:55:57,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 87 states have (on average 1.4597701149425288) internal successors, (127), 106 states have internal predecessors, (127), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:57,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 129 transitions. [2024-10-13 10:55:57,063 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 129 transitions. Word has length 17 [2024-10-13 10:55:57,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:57,063 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 129 transitions. [2024-10-13 10:55:57,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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:57,064 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 129 transitions. [2024-10-13 10:55:57,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-13 10:55:57,065 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:57,065 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:57,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 10:55:57,066 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-13 10:55:57,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:57,066 INFO L85 PathProgramCache]: Analyzing trace with hash -406520047, now seen corresponding path program 1 times [2024-10-13 10:55:57,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:57,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097805943] [2024-10-13 10:55:57,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:57,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:57,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:57,207 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:57,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:57,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097805943] [2024-10-13 10:55:57,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097805943] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:57,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:55:57,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 10:55:57,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137362250] [2024-10-13 10:55:57,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:57,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:55:57,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:57,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:55:57,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:55:57,210 INFO L87 Difference]: Start difference. First operand 108 states and 129 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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:57,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:57,357 INFO L93 Difference]: Finished difference Result 122 states and 138 transitions. [2024-10-13 10:55:57,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 10:55:57,357 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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 18 [2024-10-13 10:55:57,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:57,358 INFO L225 Difference]: With dead ends: 122 [2024-10-13 10:55:57,358 INFO L226 Difference]: Without dead ends: 118 [2024-10-13 10:55:57,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:55:57,358 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 72 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:57,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 207 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:55:57,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-13 10:55:57,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 106. [2024-10-13 10:55:57,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 85 states have (on average 1.4588235294117646) internal successors, (124), 104 states have internal predecessors, (124), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:57,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 126 transitions. [2024-10-13 10:55:57,361 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 126 transitions. Word has length 18 [2024-10-13 10:55:57,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:57,361 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 126 transitions. [2024-10-13 10:55:57,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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:57,361 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 126 transitions. [2024-10-13 10:55:57,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-13 10:55:57,362 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:57,362 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:57,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 10:55:57,363 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-13 10:55:57,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:57,363 INFO L85 PathProgramCache]: Analyzing trace with hash -77437847, now seen corresponding path program 1 times [2024-10-13 10:55:57,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:57,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738530132] [2024-10-13 10:55:57,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:57,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:57,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:57,531 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:57,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:57,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738530132] [2024-10-13 10:55:57,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738530132] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:55:57,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892734370] [2024-10-13 10:55:57,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:57,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:55:57,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:55:57,534 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:57,541 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:57,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:57,621 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-13 10:55:57,626 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:55:57,664 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:57,679 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:57,683 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:57,701 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:57,706 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:57,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:55:57,756 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:57,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:55:57,760 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:57,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-13 10:55:57,972 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-13 10:55:57,972 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 13 [2024-10-13 10:55:57,978 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:57,978 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:55:58,051 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_69| Int) (v_ArrVal_411 Int) (v_ArrVal_412 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (or (= (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_412))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) |v_ULTIMATE.start_main_~x~0#1.offset_69|)) 1) (< |v_ULTIMATE.start_main_~x~0#1.offset_69| 0) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse1 v_ArrVal_411)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1.offset_69|) (not (= v_ArrVal_412 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse1 (select v_ArrVal_412 .cse1))))))) is different from false [2024-10-13 10:55:58,117 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) (.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~head~0#1.base|))) (and (forall ((v_ArrVal_411 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_69| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_70| Int) (v_DerPreprocessor_3 Int) (v_ArrVal_412 (Array Int Int))) (let ((.cse2 (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_70|))) (or (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_412) (select v_ArrVal_412 |c_ULTIMATE.start_main_~head~0#1.offset|)) |v_ULTIMATE.start_main_~x~0#1.offset_69|)) 1) (= |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_70|) (< |v_ULTIMATE.start_main_~x~0#1.offset_69| 0) (< (select (store (store .cse0 .cse1 v_DerPreprocessor_3) .cse2 v_ArrVal_411) |c_ULTIMATE.start_main_~head~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1.offset_69|) (not (= v_ArrVal_412 (store (store .cse3 .cse1 (select v_ArrVal_412 .cse1)) .cse2 (select v_ArrVal_412 .cse2)))) (< |v_ULTIMATE.start_main_~x~0#1.offset_70| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_69| Int) (v_ArrVal_412 (Array Int Int))) (or (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_412) (select v_ArrVal_412 |c_ULTIMATE.start_main_~head~0#1.offset|)) |v_ULTIMATE.start_main_~x~0#1.offset_69|)) 1) (not (= v_ArrVal_412 (store .cse3 .cse1 (select v_ArrVal_412 .cse1)))) (< |v_ULTIMATE.start_main_~x~0#1.offset_69| 0) (< (select .cse0 |c_ULTIMATE.start_main_~head~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1.offset_69|))))) is different from false [2024-10-13 10:55:58,134 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 20 treesize of output 18 [2024-10-13 10:55:58,148 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 10:55:58,152 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 59 treesize of output 57 [2024-10-13 10:55:58,161 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:55:58,172 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:55:58,176 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:55:58,177 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:55:58,178 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:55:58,183 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 22 treesize of output 20 [2024-10-13 10:55:58,218 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 10:55:58,218 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 50 treesize of output 48 [2024-10-13 10:55:58,224 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:55:58,240 INFO L349 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2024-10-13 10:55:58,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 25 [2024-10-13 10:55:58,249 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-13 10:55:58,250 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 14 treesize of output 13 [2024-10-13 10:55:58,278 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:58,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892734370] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:55:58,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:55:58,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 15 [2024-10-13 10:55:58,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325282541] [2024-10-13 10:55:58,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:55:58,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-13 10:55:58,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:58,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-13 10:55:58,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=161, Unknown=2, NotChecked=54, Total=272 [2024-10-13 10:55:58,280 INFO L87 Difference]: Start difference. First operand 106 states and 126 transitions. Second operand has 17 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 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:58,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:58,587 INFO L93 Difference]: Finished difference Result 113 states and 128 transitions. [2024-10-13 10:55:58,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:55:58,587 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 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 18 [2024-10-13 10:55:58,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:58,588 INFO L225 Difference]: With dead ends: 113 [2024-10-13 10:55:58,588 INFO L226 Difference]: Without dead ends: 113 [2024-10-13 10:55:58,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=247, Unknown=2, NotChecked=70, Total=420 [2024-10-13 10:55:58,589 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 175 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 199 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:58,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 188 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 278 Invalid, 0 Unknown, 199 Unchecked, 0.2s Time] [2024-10-13 10:55:58,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-13 10:55:58,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 106. [2024-10-13 10:55:58,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 85 states have (on average 1.4470588235294117) internal successors, (123), 104 states have internal predecessors, (123), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:58,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 125 transitions. [2024-10-13 10:55:58,591 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 125 transitions. Word has length 18 [2024-10-13 10:55:58,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:58,592 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 125 transitions. [2024-10-13 10:55:58,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 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:58,592 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 125 transitions. [2024-10-13 10:55:58,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-13 10:55:58,592 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:58,592 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:58,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 10:55:58,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:55:58,794 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-13 10:55:58,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:58,795 INFO L85 PathProgramCache]: Analyzing trace with hash 360941279, now seen corresponding path program 1 times [2024-10-13 10:55:58,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:58,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361375236] [2024-10-13 10:55:58,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:58,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:58,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:59,078 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:59,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:59,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361375236] [2024-10-13 10:55:59,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361375236] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:55:59,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625283289] [2024-10-13 10:55:59,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:59,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:55:59,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:55:59,081 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:59,082 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:59,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:59,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-13 10:55:59,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:55:59,177 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:59,199 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:59,237 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:59,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 10:55:59,294 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:55:59,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 19 [2024-10-13 10:55:59,335 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:59,337 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:59,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:55:59,356 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:55:59,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625283289] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:55:59,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 10:55:59,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 15 [2024-10-13 10:55:59,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992105322] [2024-10-13 10:55:59,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:55:59,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 10:55:59,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:55:59,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 10:55:59,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2024-10-13 10:55:59,358 INFO L87 Difference]: Start difference. First operand 106 states and 125 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 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:59,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:55:59,522 INFO L93 Difference]: Finished difference Result 122 states and 137 transitions. [2024-10-13 10:55:59,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 10:55:59,522 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 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:59,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:55:59,523 INFO L225 Difference]: With dead ends: 122 [2024-10-13 10:55:59,523 INFO L226 Difference]: Without dead ends: 117 [2024-10-13 10:55:59,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2024-10-13 10:55:59,524 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 92 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:55:59,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 353 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:55:59,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-13 10:55:59,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 106. [2024-10-13 10:55:59,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 104 states have internal predecessors, (122), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:55:59,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 124 transitions. [2024-10-13 10:55:59,526 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 124 transitions. Word has length 19 [2024-10-13 10:55:59,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:55:59,526 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 124 transitions. [2024-10-13 10:55:59,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 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:59,527 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 124 transitions. [2024-10-13 10:55:59,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-13 10:55:59,527 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:55:59,527 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:55:59,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-13 10:55:59,729 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,SelfDestructingSolverStorable20 [2024-10-13 10:55:59,729 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-13 10:55:59,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:55:59,730 INFO L85 PathProgramCache]: Analyzing trace with hash 81664141, now seen corresponding path program 1 times [2024-10-13 10:55:59,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:55:59,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454637146] [2024-10-13 10:55:59,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:59,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:55:59,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:55:59,969 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:59,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:55:59,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454637146] [2024-10-13 10:55:59,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454637146] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:55:59,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534933520] [2024-10-13 10:55:59,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:55:59,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:55:59,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:55:59,972 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:59,975 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:56:00,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:56:00,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-13 10:56:00,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:56:00,052 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:56:00,089 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:56:00,100 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:56:00,100 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:56:00,123 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:56:00,133 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:56:00,193 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-10-13 10:56:00,193 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 23 treesize of output 15 [2024-10-13 10:56:00,204 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-13 10:56:00,204 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:56:00,260 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-13 10:56:00,260 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:56:00,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:56:00,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-13 10:56:00,341 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 10:56:00,341 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 72 treesize of output 63 [2024-10-13 10:56:00,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 25 [2024-10-13 10:56:00,373 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 36 treesize of output 20 [2024-10-13 10:56:00,377 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 15 treesize of output 7 [2024-10-13 10:56:00,395 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:00,396 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:56:00,519 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (and (forall ((v_prenex_1 Int) (v_ArrVal_550 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 .cse1 v_prenex_1)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_552 Int)) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse0 .cse1 v_ArrVal_552)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4))))) is different from false [2024-10-13 10:56:00,789 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 1306 treesize of output 1290 [2024-10-13 10:56:00,804 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:56:00,804 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 297 treesize of output 241 [2024-10-13 10:56:00,816 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:56:00,816 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 369 treesize of output 344 [2024-10-13 10:56:00,831 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 227 treesize of output 211 [2024-10-13 10:56:01,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:56:01,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:56:01,244 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:56:01,245 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 69 treesize of output 74 [2024-10-13 10:56:01,357 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:01,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534933520] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:56:01,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:56:01,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 25 [2024-10-13 10:56:01,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308800381] [2024-10-13 10:56:01,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:56:01,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-13 10:56:01,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:56:01,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-13 10:56:01,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=511, Unknown=6, NotChecked=46, Total=650 [2024-10-13 10:56:01,359 INFO L87 Difference]: Start difference. First operand 106 states and 124 transitions. Second operand has 26 states, 25 states have (on average 2.28) internal successors, (57), 26 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:56:02,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:56:02,542 INFO L93 Difference]: Finished difference Result 177 states and 208 transitions. [2024-10-13 10:56:02,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 10:56:02,544 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.28) internal successors, (57), 26 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 19 [2024-10-13 10:56:02,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:56:02,545 INFO L225 Difference]: With dead ends: 177 [2024-10-13 10:56:02,545 INFO L226 Difference]: Without dead ends: 177 [2024-10-13 10:56:02,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=202, Invalid=918, Unknown=6, NotChecked=64, Total=1190 [2024-10-13 10:56:02,546 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 298 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 1228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 141 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 10:56:02,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 501 Invalid, 1228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1056 Invalid, 0 Unknown, 141 Unchecked, 0.8s Time] [2024-10-13 10:56:02,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-10-13 10:56:02,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 153. [2024-10-13 10:56:02,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 133 states have (on average 1.4661654135338347) internal successors, (195), 151 states have internal predecessors, (195), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:56:02,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 197 transitions. [2024-10-13 10:56:02,550 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 197 transitions. Word has length 19 [2024-10-13 10:56:02,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:56:02,550 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 197 transitions. [2024-10-13 10:56:02,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.28) internal successors, (57), 26 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:56:02,550 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 197 transitions. [2024-10-13 10:56:02,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-13 10:56:02,551 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:56:02,551 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:56:02,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 10:56:02,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:56:02,752 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-13 10:56:02,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:56:02,752 INFO L85 PathProgramCache]: Analyzing trace with hash 81664140, now seen corresponding path program 1 times [2024-10-13 10:56:02,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:56:02,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077188479] [2024-10-13 10:56:02,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:56:02,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:56:02,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:56:02,904 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:02,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:56:02,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077188479] [2024-10-13 10:56:02,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077188479] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:56:02,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571553537] [2024-10-13 10:56:02,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:56:02,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:56:02,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:56:02,906 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:56:02,907 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:56:02,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:56:02,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-13 10:56:02,983 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:56:03,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 10:56:03,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 10:56:03,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 10:56:03,068 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:56:03,097 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-13 10:56:03,097 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 28 treesize of output 23 [2024-10-13 10:56:03,129 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-13 10:56:03,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2024-10-13 10:56:03,173 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-13 10:56:03,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 37 [2024-10-13 10:56:03,195 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-13 10:56:03,195 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 15 [2024-10-13 10:56:03,199 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:03,200 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:56:03,211 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_639 (Array Int Int))) (or (not (= v_ArrVal_639 (let ((.cse0 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse0 (select v_ArrVal_639 .cse0))))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_639) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1))) is different from false [2024-10-13 10:56:03,283 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_80| Int) (v_ArrVal_639 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= v_ArrVal_639 (let ((.cse1 (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_80|))) (store (store (select |c_#memory_$Pointer$#1.base| .cse0) |v_ULTIMATE.start_main_~x~0#1.offset_80| |c_ULTIMATE.start_main_~head~0#1.base|) .cse1 (select v_ArrVal_639 .cse1))))) (< (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1.offset_80|) (< |v_ULTIMATE.start_main_~x~0#1.offset_80| 0) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_639) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)))) is different from false [2024-10-13 10:56:03,289 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:56:03,290 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 47 treesize of output 39 [2024-10-13 10:56:03,302 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:56:03,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 70 [2024-10-13 10:56:03,328 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 6 treesize of output 4 [2024-10-13 10:56:03,351 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:56:03,352 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 18 treesize of output 22 [2024-10-13 10:56:03,372 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 5 [2024-10-13 10:56:03,388 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:56:03,389 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 136 treesize of output 136 [2024-10-13 10:56:12,608 WARN L286 SmtUtils]: Spent 7.50s on a formula simplification that was a NOOP. DAG size: 1683 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-10-13 10:56:12,609 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:56:12,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 29 select indices, 29 select index equivalence classes, 0 disjoint index pairs (out of 406 index pairs), introduced 29 new quantified variables, introduced 406 case distinctions, treesize of input 723 treesize of output 3912