./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0217_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0217_1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 e4aac8fd1b71e0bd84f9ab8e5c238dc6bf3a295fcb9cebe504ba6d0c9a6a7b7a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:55:01,500 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:55:01,561 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 17:55:01,566 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:55:01,567 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:55:01,589 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:55:01,590 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:55:01,590 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:55:01,590 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 17:55:01,591 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 17:55:01,591 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:55:01,591 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:55:01,592 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:55:01,593 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:55:01,594 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:55:01,594 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:55:01,594 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:55:01,594 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:55:01,594 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:55:01,595 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:55:01,595 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 17:55:01,599 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 17:55:01,599 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 17:55:01,599 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:55:01,599 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 17:55:01,600 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:55:01,600 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:55:01,600 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:55:01,600 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:55:01,600 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:55:01,601 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:55:01,601 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 17:55:01,601 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:55:01,601 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:55:01,601 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:55:01,602 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:55:01,602 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:55:01,602 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:55:01,602 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:55:01,602 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:55:01,603 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:55:01,603 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:55:01,603 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-clean/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-clean/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 -> e4aac8fd1b71e0bd84f9ab8e5c238dc6bf3a295fcb9cebe504ba6d0c9a6a7b7a [2024-10-11 17:55:01,823 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:55:01,845 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:55:01,855 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:55:01,856 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:55:01,856 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:55:01,857 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0217_1.i [2024-10-11 17:55:03,112 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:55:03,303 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:55:03,307 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0217_1.i [2024-10-11 17:55:03,322 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e235c35f2/98ab0eefef7840caa07e4b3c4bbda52c/FLAG072a55a6d [2024-10-11 17:55:03,334 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e235c35f2/98ab0eefef7840caa07e4b3c4bbda52c [2024-10-11 17:55:03,336 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:55:03,337 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:55:03,339 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:55:03,339 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:55:03,343 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:55:03,344 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:55:03" (1/1) ... [2024-10-11 17:55:03,345 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b692043 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:03, skipping insertion in model container [2024-10-11 17:55:03,345 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:55:03" (1/1) ... [2024-10-11 17:55:03,383 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:55:03,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:55:03,714 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:55:03,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:55:03,819 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:55:03,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:03 WrapperNode [2024-10-11 17:55:03,819 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:55:03,820 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:55:03,820 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:55:03,820 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:55:03,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:03" (1/1) ... [2024-10-11 17:55:03,839 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:03" (1/1) ... [2024-10-11 17:55:03,865 INFO L138 Inliner]: procedures = 181, calls = 47, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 254 [2024-10-11 17:55:03,866 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:55:03,867 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:55:03,868 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:55:03,868 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:55:03,877 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:03" (1/1) ... [2024-10-11 17:55:03,877 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:03" (1/1) ... [2024-10-11 17:55:03,883 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:03" (1/1) ... [2024-10-11 17:55:03,908 INFO L175 MemorySlicer]: Split 32 memory accesses to 2 slices as follows [2, 30]. 94 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 11 writes are split as follows [0, 11]. [2024-10-11 17:55:03,909 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:03" (1/1) ... [2024-10-11 17:55:03,911 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:03" (1/1) ... [2024-10-11 17:55:03,920 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:03" (1/1) ... [2024-10-11 17:55:03,923 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:03" (1/1) ... [2024-10-11 17:55:03,925 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:03" (1/1) ... [2024-10-11 17:55:03,926 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:03" (1/1) ... [2024-10-11 17:55:03,929 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:55:03,931 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:55:03,932 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:55:03,932 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:55:03,933 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:03" (1/1) ... [2024-10-11 17:55:03,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:55:03,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:55:03,973 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:55:03,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:55:04,012 INFO L130 BoogieDeclarations]: Found specification of procedure rand_end_point [2024-10-11 17:55:04,013 INFO L138 BoogieDeclarations]: Found implementation of procedure rand_end_point [2024-10-11 17:55:04,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 17:55:04,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 17:55:04,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:55:04,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:55:04,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 17:55:04,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 17:55:04,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 17:55:04,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 17:55:04,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:55:04,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 17:55:04,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 17:55:04,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 17:55:04,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 17:55:04,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:55:04,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:55:04,121 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:55:04,123 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:55:04,551 INFO L? ?]: Removed 186 outVars from TransFormulas that were not future-live. [2024-10-11 17:55:04,551 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:55:04,603 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:55:04,608 INFO L314 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-11 17:55:04,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:55:04 BoogieIcfgContainer [2024-10-11 17:55:04,609 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:55:04,610 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:55:04,610 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:55:04,613 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:55:04,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:55:03" (1/3) ... [2024-10-11 17:55:04,614 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ed31ca0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:55:04, skipping insertion in model container [2024-10-11 17:55:04,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:03" (2/3) ... [2024-10-11 17:55:04,615 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ed31ca0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:55:04, skipping insertion in model container [2024-10-11 17:55:04,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:55:04" (3/3) ... [2024-10-11 17:55:04,617 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0217_1.i [2024-10-11 17:55:04,630 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:55:04,631 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 67 error locations. [2024-10-11 17:55:04,667 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:55:04,672 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;@761075af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:55:04,673 INFO L334 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2024-10-11 17:55:04,680 INFO L276 IsEmpty]: Start isEmpty. Operand has 151 states, 80 states have (on average 2.2) internal successors, (176), 147 states have internal predecessors, (176), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:55:04,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 17:55:04,685 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:04,686 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 17:55:04,686 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:55:04,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:04,691 INFO L85 PathProgramCache]: Analyzing trace with hash 348415767, now seen corresponding path program 1 times [2024-10-11 17:55:04,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:04,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126646732] [2024-10-11 17:55:04,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:04,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:04,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:04,830 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-11 17:55:04,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:04,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126646732] [2024-10-11 17:55:04,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126646732] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:04,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:04,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:55:04,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939275290] [2024-10-11 17:55:04,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:04,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 17:55:04,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:04,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 17:55:04,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 17:55:04,867 INFO L87 Difference]: Start difference. First operand has 151 states, 80 states have (on average 2.2) internal successors, (176), 147 states have internal predecessors, (176), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:04,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:04,917 INFO L93 Difference]: Finished difference Result 151 states and 173 transitions. [2024-10-11 17:55:04,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 17:55:04,920 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 17:55:04,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:04,927 INFO L225 Difference]: With dead ends: 151 [2024-10-11 17:55:04,927 INFO L226 Difference]: Without dead ends: 150 [2024-10-11 17:55:04,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 17:55:04,933 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:04,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:55:04,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-11 17:55:04,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2024-10-11 17:55:04,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 80 states have (on average 2.1) internal successors, (168), 146 states have internal predecessors, (168), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:55:04,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 172 transitions. [2024-10-11 17:55:04,982 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 172 transitions. Word has length 5 [2024-10-11 17:55:04,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:04,982 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 172 transitions. [2024-10-11 17:55:04,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:04,983 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 172 transitions. [2024-10-11 17:55:04,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 17:55:04,983 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:04,983 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:04,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:55:04,984 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:55:04,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:04,985 INFO L85 PathProgramCache]: Analyzing trace with hash 543993533, now seen corresponding path program 1 times [2024-10-11 17:55:04,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:04,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719603814] [2024-10-11 17:55:04,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:04,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:05,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:05,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-11 17:55:05,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:05,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719603814] [2024-10-11 17:55:05,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719603814] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:05,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:05,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:55:05,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103637073] [2024-10-11 17:55:05,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:05,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:55:05,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:05,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:55:05,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:55:05,082 INFO L87 Difference]: Start difference. First operand 150 states and 172 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:05,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:05,216 INFO L93 Difference]: Finished difference Result 296 states and 340 transitions. [2024-10-11 17:55:05,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:55:05,217 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 17:55:05,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:05,219 INFO L225 Difference]: With dead ends: 296 [2024-10-11 17:55:05,219 INFO L226 Difference]: Without dead ends: 296 [2024-10-11 17:55:05,219 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-11 17:55:05,220 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 163 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:05,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 454 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:05,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-10-11 17:55:05,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 152. [2024-10-11 17:55:05,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 82 states have (on average 2.073170731707317) internal successors, (170), 148 states have internal predecessors, (170), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:55:05,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 174 transitions. [2024-10-11 17:55:05,235 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 174 transitions. Word has length 7 [2024-10-11 17:55:05,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:05,235 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 174 transitions. [2024-10-11 17:55:05,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:05,235 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 174 transitions. [2024-10-11 17:55:05,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 17:55:05,236 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:05,236 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:05,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:55:05,236 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:55:05,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:05,237 INFO L85 PathProgramCache]: Analyzing trace with hash 542146491, now seen corresponding path program 1 times [2024-10-11 17:55:05,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:05,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112506335] [2024-10-11 17:55:05,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:05,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:05,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:05,325 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-11 17:55:05,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:05,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112506335] [2024-10-11 17:55:05,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112506335] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:05,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:05,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 17:55:05,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269377758] [2024-10-11 17:55:05,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:05,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:55:05,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:05,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:55:05,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:55:05,331 INFO L87 Difference]: Start difference. First operand 152 states and 174 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:05,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:05,508 INFO L93 Difference]: Finished difference Result 295 states and 338 transitions. [2024-10-11 17:55:05,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:55:05,509 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 17:55:05,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:05,511 INFO L225 Difference]: With dead ends: 295 [2024-10-11 17:55:05,511 INFO L226 Difference]: Without dead ends: 295 [2024-10-11 17:55:05,511 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-11 17:55:05,512 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 154 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:05,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 208 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:55:05,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-10-11 17:55:05,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 207. [2024-10-11 17:55:05,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 134 states have (on average 2.0597014925373136) internal successors, (276), 200 states have internal predecessors, (276), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 17:55:05,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 284 transitions. [2024-10-11 17:55:05,536 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 284 transitions. Word has length 7 [2024-10-11 17:55:05,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:05,536 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 284 transitions. [2024-10-11 17:55:05,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:05,537 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 284 transitions. [2024-10-11 17:55:05,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 17:55:05,537 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:05,537 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:05,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:55:05,539 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:55:05,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:05,539 INFO L85 PathProgramCache]: Analyzing trace with hash 542146492, now seen corresponding path program 1 times [2024-10-11 17:55:05,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:05,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561851683] [2024-10-11 17:55:05,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:05,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:05,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:05,633 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-11 17:55:05,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:05,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561851683] [2024-10-11 17:55:05,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561851683] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:05,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:05,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:55:05,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813266571] [2024-10-11 17:55:05,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:05,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:55:05,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:05,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:55:05,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:55:05,637 INFO L87 Difference]: Start difference. First operand 207 states and 284 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:05,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:05,781 INFO L93 Difference]: Finished difference Result 328 states and 434 transitions. [2024-10-11 17:55:05,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:55:05,781 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 17:55:05,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:05,782 INFO L225 Difference]: With dead ends: 328 [2024-10-11 17:55:05,783 INFO L226 Difference]: Without dead ends: 328 [2024-10-11 17:55:05,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:55:05,784 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 100 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:05,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 351 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:05,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2024-10-11 17:55:05,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 279. [2024-10-11 17:55:05,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 200 states have (on average 1.99) internal successors, (398), 268 states have internal predecessors, (398), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 17:55:05,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 414 transitions. [2024-10-11 17:55:05,796 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 414 transitions. Word has length 7 [2024-10-11 17:55:05,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:05,796 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 414 transitions. [2024-10-11 17:55:05,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:05,796 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 414 transitions. [2024-10-11 17:55:05,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 17:55:05,797 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:05,797 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:05,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:55:05,797 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:55:05,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:05,797 INFO L85 PathProgramCache]: Analyzing trace with hash 542146554, now seen corresponding path program 1 times [2024-10-11 17:55:05,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:05,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335986794] [2024-10-11 17:55:05,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:05,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:05,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:05,883 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-11 17:55:05,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:05,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335986794] [2024-10-11 17:55:05,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335986794] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:05,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:05,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:55:05,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147386913] [2024-10-11 17:55:05,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:05,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:55:05,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:05,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:55:05,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:55:05,885 INFO L87 Difference]: Start difference. First operand 279 states and 414 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:06,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:06,013 INFO L93 Difference]: Finished difference Result 327 states and 432 transitions. [2024-10-11 17:55:06,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:55:06,013 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 17:55:06,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:06,017 INFO L225 Difference]: With dead ends: 327 [2024-10-11 17:55:06,017 INFO L226 Difference]: Without dead ends: 327 [2024-10-11 17:55:06,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:55:06,021 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 98 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:06,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 352 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:06,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-10-11 17:55:06,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 279. [2024-10-11 17:55:06,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 200 states have (on average 1.99) internal successors, (398), 268 states have internal predecessors, (398), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 17:55:06,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 414 transitions. [2024-10-11 17:55:06,033 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 414 transitions. Word has length 7 [2024-10-11 17:55:06,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:06,034 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 414 transitions. [2024-10-11 17:55:06,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:06,035 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 414 transitions. [2024-10-11 17:55:06,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 17:55:06,035 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:06,035 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:06,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:55:06,035 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:55:06,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:06,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1311781123, now seen corresponding path program 1 times [2024-10-11 17:55:06,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:06,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120655353] [2024-10-11 17:55:06,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:06,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:06,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:06,077 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-11 17:55:06,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:06,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120655353] [2024-10-11 17:55:06,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120655353] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:06,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:06,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:55:06,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78424570] [2024-10-11 17:55:06,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:06,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:55:06,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:06,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:55:06,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:55:06,079 INFO L87 Difference]: Start difference. First operand 279 states and 414 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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-11 17:55:06,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:06,128 INFO L93 Difference]: Finished difference Result 398 states and 549 transitions. [2024-10-11 17:55:06,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:55:06,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2024-10-11 17:55:06,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:06,133 INFO L225 Difference]: With dead ends: 398 [2024-10-11 17:55:06,133 INFO L226 Difference]: Without dead ends: 398 [2024-10-11 17:55:06,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:55:06,134 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 143 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:06,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 301 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:55:06,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-10-11 17:55:06,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 280. [2024-10-11 17:55:06,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 201 states have (on average 1.9751243781094527) internal successors, (397), 269 states have internal predecessors, (397), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 17:55:06,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 413 transitions. [2024-10-11 17:55:06,145 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 413 transitions. Word has length 9 [2024-10-11 17:55:06,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:06,145 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 413 transitions. [2024-10-11 17:55:06,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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-11 17:55:06,146 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 413 transitions. [2024-10-11 17:55:06,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 17:55:06,146 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:06,146 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:06,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:55:06,146 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:55:06,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:06,147 INFO L85 PathProgramCache]: Analyzing trace with hash 2010507914, now seen corresponding path program 1 times [2024-10-11 17:55:06,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:06,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484353367] [2024-10-11 17:55:06,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:06,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:06,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:06,178 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-11 17:55:06,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:06,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484353367] [2024-10-11 17:55:06,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484353367] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:06,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:06,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 17:55:06,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106832501] [2024-10-11 17:55:06,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:06,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:55:06,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:06,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:55:06,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:55:06,179 INFO L87 Difference]: Start difference. First operand 280 states and 413 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 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-11 17:55:06,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:06,278 INFO L93 Difference]: Finished difference Result 328 states and 457 transitions. [2024-10-11 17:55:06,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:55:06,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 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-11 17:55:06,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:06,280 INFO L225 Difference]: With dead ends: 328 [2024-10-11 17:55:06,280 INFO L226 Difference]: Without dead ends: 322 [2024-10-11 17:55:06,281 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-11 17:55:06,281 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 66 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:06,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 236 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:06,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-10-11 17:55:06,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 277. [2024-10-11 17:55:06,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 198 states have (on average 1.97979797979798) internal successors, (392), 266 states have internal predecessors, (392), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 17:55:06,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 408 transitions. [2024-10-11 17:55:06,291 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 408 transitions. Word has length 10 [2024-10-11 17:55:06,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:06,291 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 408 transitions. [2024-10-11 17:55:06,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 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-11 17:55:06,291 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 408 transitions. [2024-10-11 17:55:06,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 17:55:06,292 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:06,292 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:06,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:55:06,292 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:55:06,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:06,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1415086410, now seen corresponding path program 1 times [2024-10-11 17:55:06,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:06,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449843319] [2024-10-11 17:55:06,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:06,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:06,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:06,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 17:55:06,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:06,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:06,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:06,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449843319] [2024-10-11 17:55:06,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449843319] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:06,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:06,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:55:06,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183684960] [2024-10-11 17:55:06,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:06,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:55:06,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:06,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:55:06,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:55:06,343 INFO L87 Difference]: Start difference. First operand 277 states and 408 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:06,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:06,399 INFO L93 Difference]: Finished difference Result 448 states and 647 transitions. [2024-10-11 17:55:06,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:55:06,400 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-10-11 17:55:06,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:06,401 INFO L225 Difference]: With dead ends: 448 [2024-10-11 17:55:06,401 INFO L226 Difference]: Without dead ends: 448 [2024-10-11 17:55:06,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:55:06,402 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 159 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:06,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 431 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:55:06,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2024-10-11 17:55:06,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 281. [2024-10-11 17:55:06,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 202 states have (on average 1.9504950495049505) internal successors, (394), 270 states have internal predecessors, (394), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 17:55:06,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 410 transitions. [2024-10-11 17:55:06,409 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 410 transitions. Word has length 16 [2024-10-11 17:55:06,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:06,410 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 410 transitions. [2024-10-11 17:55:06,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:06,410 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 410 transitions. [2024-10-11 17:55:06,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 17:55:06,411 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:06,411 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:06,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:55:06,411 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:55:06,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:06,411 INFO L85 PathProgramCache]: Analyzing trace with hash -2116150988, now seen corresponding path program 1 times [2024-10-11 17:55:06,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:06,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264536304] [2024-10-11 17:55:06,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:06,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:06,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:06,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 17:55:06,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:06,434 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-11 17:55:06,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:06,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264536304] [2024-10-11 17:55:06,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264536304] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:06,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:06,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:55:06,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660002315] [2024-10-11 17:55:06,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:06,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:55:06,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:06,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:55:06,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:55:06,435 INFO L87 Difference]: Start difference. First operand 281 states and 410 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:06,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:06,467 INFO L93 Difference]: Finished difference Result 285 states and 414 transitions. [2024-10-11 17:55:06,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:55:06,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-10-11 17:55:06,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:06,468 INFO L225 Difference]: With dead ends: 285 [2024-10-11 17:55:06,468 INFO L226 Difference]: Without dead ends: 285 [2024-10-11 17:55:06,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11 17:55:06,469 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:06,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 304 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:55:06,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-10-11 17:55:06,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2024-10-11 17:55:06,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 206 states have (on average 1.9320388349514563) internal successors, (398), 274 states have internal predecessors, (398), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 17:55:06,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 414 transitions. [2024-10-11 17:55:06,476 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 414 transitions. Word has length 16 [2024-10-11 17:55:06,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:06,476 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 414 transitions. [2024-10-11 17:55:06,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:06,477 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 414 transitions. [2024-10-11 17:55:06,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 17:55:06,477 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:06,477 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:06,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:55:06,477 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:55:06,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:06,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1306804362, now seen corresponding path program 1 times [2024-10-11 17:55:06,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:06,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995340097] [2024-10-11 17:55:06,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:06,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:06,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:06,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 17:55:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:06,544 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-11 17:55:06,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:06,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995340097] [2024-10-11 17:55:06,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995340097] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:06,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:06,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:55:06,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070986568] [2024-10-11 17:55:06,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:06,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:55:06,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:06,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:55:06,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:55:06,550 INFO L87 Difference]: Start difference. First operand 285 states and 414 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:06,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:06,712 INFO L93 Difference]: Finished difference Result 387 states and 503 transitions. [2024-10-11 17:55:06,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:55:06,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-10-11 17:55:06,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:06,714 INFO L225 Difference]: With dead ends: 387 [2024-10-11 17:55:06,714 INFO L226 Difference]: Without dead ends: 387 [2024-10-11 17:55:06,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:55:06,714 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 153 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:06,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 301 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:06,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2024-10-11 17:55:06,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 291. [2024-10-11 17:55:06,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 212 states have (on average 1.9056603773584906) internal successors, (404), 280 states have internal predecessors, (404), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 17:55:06,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 420 transitions. [2024-10-11 17:55:06,720 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 420 transitions. Word has length 16 [2024-10-11 17:55:06,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:06,720 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 420 transitions. [2024-10-11 17:55:06,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:06,720 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 420 transitions. [2024-10-11 17:55:06,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 17:55:06,720 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:06,720 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:06,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:55:06,721 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:55:06,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:06,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1306804361, now seen corresponding path program 1 times [2024-10-11 17:55:06,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:06,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893726457] [2024-10-11 17:55:06,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:06,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:06,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:06,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 17:55:06,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:06,848 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-11 17:55:06,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:06,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893726457] [2024-10-11 17:55:06,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893726457] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:06,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:06,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:55:06,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782578573] [2024-10-11 17:55:06,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:06,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:55:06,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:06,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:55:06,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:55:06,849 INFO L87 Difference]: Start difference. First operand 291 states and 420 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:07,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:07,001 INFO L93 Difference]: Finished difference Result 324 states and 419 transitions. [2024-10-11 17:55:07,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:55:07,002 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-10-11 17:55:07,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:07,003 INFO L225 Difference]: With dead ends: 324 [2024-10-11 17:55:07,003 INFO L226 Difference]: Without dead ends: 324 [2024-10-11 17:55:07,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:55:07,004 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 82 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:07,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 361 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:07,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-10-11 17:55:07,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 291. [2024-10-11 17:55:07,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 212 states have (on average 1.8773584905660377) internal successors, (398), 280 states have internal predecessors, (398), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 17:55:07,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 414 transitions. [2024-10-11 17:55:07,011 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 414 transitions. Word has length 16 [2024-10-11 17:55:07,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:07,012 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 414 transitions. [2024-10-11 17:55:07,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:07,012 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 414 transitions. [2024-10-11 17:55:07,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 17:55:07,014 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:07,014 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:07,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:55:07,015 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:55:07,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:07,017 INFO L85 PathProgramCache]: Analyzing trace with hash 943605357, now seen corresponding path program 1 times [2024-10-11 17:55:07,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:07,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443300049] [2024-10-11 17:55:07,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:07,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:07,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:07,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:55:07,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:07,110 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-11 17:55:07,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:07,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443300049] [2024-10-11 17:55:07,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443300049] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:07,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:07,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:55:07,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088081191] [2024-10-11 17:55:07,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:07,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:55:07,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:07,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:55:07,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:55:07,112 INFO L87 Difference]: Start difference. First operand 291 states and 414 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:07,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:07,313 INFO L93 Difference]: Finished difference Result 395 states and 518 transitions. [2024-10-11 17:55:07,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:55:07,313 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-10-11 17:55:07,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:07,315 INFO L225 Difference]: With dead ends: 395 [2024-10-11 17:55:07,315 INFO L226 Difference]: Without dead ends: 395 [2024-10-11 17:55:07,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:55:07,315 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 281 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:07,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 288 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:55:07,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-10-11 17:55:07,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 288. [2024-10-11 17:55:07,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 213 states have (on average 1.84037558685446) internal successors, (392), 277 states have internal predecessors, (392), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 17:55:07,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 408 transitions. [2024-10-11 17:55:07,321 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 408 transitions. Word has length 17 [2024-10-11 17:55:07,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:07,321 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 408 transitions. [2024-10-11 17:55:07,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:07,322 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 408 transitions. [2024-10-11 17:55:07,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 17:55:07,322 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:07,322 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:07,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 17:55:07,322 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:55:07,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:07,323 INFO L85 PathProgramCache]: Analyzing trace with hash 943605358, now seen corresponding path program 1 times [2024-10-11 17:55:07,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:07,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242744695] [2024-10-11 17:55:07,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:07,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:07,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:07,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:55:07,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:07,518 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-11 17:55:07,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:07,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242744695] [2024-10-11 17:55:07,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242744695] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:07,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:07,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 17:55:07,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709947956] [2024-10-11 17:55:07,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:07,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 17:55:07,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:07,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 17:55:07,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:55:07,520 INFO L87 Difference]: Start difference. First operand 288 states and 408 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:07,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:07,885 INFO L93 Difference]: Finished difference Result 406 states and 520 transitions. [2024-10-11 17:55:07,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 17:55:07,885 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-10-11 17:55:07,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:07,887 INFO L225 Difference]: With dead ends: 406 [2024-10-11 17:55:07,887 INFO L226 Difference]: Without dead ends: 406 [2024-10-11 17:55:07,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-11 17:55:07,888 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 211 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:07,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 465 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 17:55:07,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2024-10-11 17:55:07,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 302. [2024-10-11 17:55:07,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 227 states have (on average 1.854625550660793) internal successors, (421), 291 states have internal predecessors, (421), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 17:55:07,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 437 transitions. [2024-10-11 17:55:07,893 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 437 transitions. Word has length 17 [2024-10-11 17:55:07,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:07,894 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 437 transitions. [2024-10-11 17:55:07,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:07,894 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 437 transitions. [2024-10-11 17:55:07,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 17:55:07,894 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:07,894 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:07,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 17:55:07,895 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:55:07,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:07,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1083822630, now seen corresponding path program 1 times [2024-10-11 17:55:07,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:07,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95347893] [2024-10-11 17:55:07,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:07,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:07,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:08,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 17:55:08,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:08,035 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-11 17:55:08,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:08,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95347893] [2024-10-11 17:55:08,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95347893] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:08,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:08,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 17:55:08,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098198716] [2024-10-11 17:55:08,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:08,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:55:08,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:08,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:55:08,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:55:08,037 INFO L87 Difference]: Start difference. First operand 302 states and 437 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:08,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:08,260 INFO L93 Difference]: Finished difference Result 413 states and 580 transitions. [2024-10-11 17:55:08,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:55:08,261 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-10-11 17:55:08,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:08,262 INFO L225 Difference]: With dead ends: 413 [2024-10-11 17:55:08,262 INFO L226 Difference]: Without dead ends: 413 [2024-10-11 17:55:08,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-11 17:55:08,263 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 92 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:08,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 683 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:08,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-10-11 17:55:08,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 333. [2024-10-11 17:55:08,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 255 states have (on average 1.8352941176470587) internal successors, (468), 320 states have internal predecessors, (468), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 17:55:08,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 488 transitions. [2024-10-11 17:55:08,269 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 488 transitions. Word has length 20 [2024-10-11 17:55:08,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:08,269 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 488 transitions. [2024-10-11 17:55:08,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:08,270 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 488 transitions. [2024-10-11 17:55:08,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 17:55:08,270 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:08,270 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:08,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 17:55:08,270 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:55:08,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:08,271 INFO L85 PathProgramCache]: Analyzing trace with hash 393964893, now seen corresponding path program 1 times [2024-10-11 17:55:08,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:08,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377214800] [2024-10-11 17:55:08,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:08,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:08,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:08,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:55:08,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:08,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:08,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:08,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377214800] [2024-10-11 17:55:08,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377214800] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:08,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:08,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 17:55:08,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742311949] [2024-10-11 17:55:08,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:08,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 17:55:08,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:08,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 17:55:08,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:55:08,462 INFO L87 Difference]: Start difference. First operand 333 states and 488 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:08,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:08,656 INFO L93 Difference]: Finished difference Result 393 states and 541 transitions. [2024-10-11 17:55:08,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 17:55:08,656 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-10-11 17:55:08,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:08,658 INFO L225 Difference]: With dead ends: 393 [2024-10-11 17:55:08,658 INFO L226 Difference]: Without dead ends: 393 [2024-10-11 17:55:08,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-11 17:55:08,659 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 91 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:08,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 771 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:08,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-10-11 17:55:08,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 351. [2024-10-11 17:55:08,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 273 states have (on average 1.8021978021978022) internal successors, (492), 336 states have internal predecessors, (492), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 17:55:08,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 512 transitions. [2024-10-11 17:55:08,667 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 512 transitions. Word has length 20 [2024-10-11 17:55:08,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:08,668 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 512 transitions. [2024-10-11 17:55:08,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:08,668 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 512 transitions. [2024-10-11 17:55:08,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 17:55:08,669 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:08,669 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:08,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 17:55:08,669 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:55:08,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:08,670 INFO L85 PathProgramCache]: Analyzing trace with hash 761609393, now seen corresponding path program 1 times [2024-10-11 17:55:08,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:08,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501822826] [2024-10-11 17:55:08,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:08,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:08,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:08,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 17:55:08,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:08,719 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-11 17:55:08,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:08,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501822826] [2024-10-11 17:55:08,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501822826] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:08,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:08,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:55:08,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632953310] [2024-10-11 17:55:08,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:08,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:55:08,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:08,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:55:08,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:55:08,721 INFO L87 Difference]: Start difference. First operand 351 states and 512 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:08,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:08,839 INFO L93 Difference]: Finished difference Result 354 states and 509 transitions. [2024-10-11 17:55:08,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:55:08,841 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-10-11 17:55:08,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:08,842 INFO L225 Difference]: With dead ends: 354 [2024-10-11 17:55:08,842 INFO L226 Difference]: Without dead ends: 354 [2024-10-11 17:55:08,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:55:08,843 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 26 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:08,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 413 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:08,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-10-11 17:55:08,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 348. [2024-10-11 17:55:08,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 276 states have (on average 1.7427536231884058) internal successors, (481), 333 states have internal predecessors, (481), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 17:55:08,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 501 transitions. [2024-10-11 17:55:08,849 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 501 transitions. Word has length 21 [2024-10-11 17:55:08,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:08,849 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 501 transitions. [2024-10-11 17:55:08,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:08,849 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 501 transitions. [2024-10-11 17:55:08,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 17:55:08,850 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:08,850 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:08,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 17:55:08,850 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:55:08,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:08,850 INFO L85 PathProgramCache]: Analyzing trace with hash 761609394, now seen corresponding path program 1 times [2024-10-11 17:55:08,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:08,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488236848] [2024-10-11 17:55:08,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:08,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:08,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:08,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 17:55:08,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:08,989 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-11 17:55:08,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:08,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488236848] [2024-10-11 17:55:08,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488236848] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:08,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:08,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 17:55:08,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675364666] [2024-10-11 17:55:08,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:08,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 17:55:08,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:08,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 17:55:08,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:55:08,990 INFO L87 Difference]: Start difference. First operand 348 states and 501 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:09,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:09,123 INFO L93 Difference]: Finished difference Result 258 states and 354 transitions. [2024-10-11 17:55:09,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:55:09,124 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-10-11 17:55:09,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:09,125 INFO L225 Difference]: With dead ends: 258 [2024-10-11 17:55:09,125 INFO L226 Difference]: Without dead ends: 258 [2024-10-11 17:55:09,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-11 17:55:09,125 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 36 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:09,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 662 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:09,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-10-11 17:55:09,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 254. [2024-10-11 17:55:09,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 188 states have (on average 1.797872340425532) internal successors, (338), 244 states have internal predecessors, (338), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 17:55:09,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 350 transitions. [2024-10-11 17:55:09,130 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 350 transitions. Word has length 21 [2024-10-11 17:55:09,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:09,130 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 350 transitions. [2024-10-11 17:55:09,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:09,130 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 350 transitions. [2024-10-11 17:55:09,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 17:55:09,131 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:09,131 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:09,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 17:55:09,131 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:55:09,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:09,131 INFO L85 PathProgramCache]: Analyzing trace with hash -671702513, now seen corresponding path program 1 times [2024-10-11 17:55:09,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:09,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781744015] [2024-10-11 17:55:09,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:09,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:09,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:09,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:55:09,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:09,159 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-11 17:55:09,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:09,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781744015] [2024-10-11 17:55:09,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781744015] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:09,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:09,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:55:09,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122770148] [2024-10-11 17:55:09,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:09,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:55:09,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:09,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:55:09,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:55:09,160 INFO L87 Difference]: Start difference. First operand 254 states and 350 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:09,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:09,220 INFO L93 Difference]: Finished difference Result 251 states and 341 transitions. [2024-10-11 17:55:09,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:55:09,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-10-11 17:55:09,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:09,222 INFO L225 Difference]: With dead ends: 251 [2024-10-11 17:55:09,222 INFO L226 Difference]: Without dead ends: 251 [2024-10-11 17:55:09,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:55:09,223 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 24 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:09,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 213 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:09,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-10-11 17:55:09,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2024-10-11 17:55:09,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 188 states have (on average 1.75) internal successors, (329), 241 states have internal predecessors, (329), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 17:55:09,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 341 transitions. [2024-10-11 17:55:09,227 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 341 transitions. Word has length 21 [2024-10-11 17:55:09,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:09,227 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 341 transitions. [2024-10-11 17:55:09,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:09,227 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 341 transitions. [2024-10-11 17:55:09,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 17:55:09,228 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:09,228 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:09,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 17:55:09,228 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:55:09,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:09,229 INFO L85 PathProgramCache]: Analyzing trace with hash -671702512, now seen corresponding path program 1 times [2024-10-11 17:55:09,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:09,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297737168] [2024-10-11 17:55:09,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:09,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:09,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:09,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:55:09,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:09,296 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-11 17:55:09,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:09,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297737168] [2024-10-11 17:55:09,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297737168] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:09,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:09,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:55:09,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846383394] [2024-10-11 17:55:09,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:09,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:55:09,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:09,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:55:09,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:55:09,299 INFO L87 Difference]: Start difference. First operand 251 states and 341 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:09,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:09,396 INFO L93 Difference]: Finished difference Result 288 states and 394 transitions. [2024-10-11 17:55:09,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:55:09,397 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-10-11 17:55:09,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:09,398 INFO L225 Difference]: With dead ends: 288 [2024-10-11 17:55:09,398 INFO L226 Difference]: Without dead ends: 288 [2024-10-11 17:55:09,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:55:09,398 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 44 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:09,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 310 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:09,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-10-11 17:55:09,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 282. [2024-10-11 17:55:09,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 220 states have (on average 1.7363636363636363) internal successors, (382), 272 states have internal predecessors, (382), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 17:55:09,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 394 transitions. [2024-10-11 17:55:09,405 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 394 transitions. Word has length 21 [2024-10-11 17:55:09,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:09,405 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 394 transitions. [2024-10-11 17:55:09,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:09,405 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 394 transitions. [2024-10-11 17:55:09,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 17:55:09,405 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:09,406 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:09,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 17:55:09,406 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:55:09,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:09,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1872197656, now seen corresponding path program 1 times [2024-10-11 17:55:09,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:09,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722107593] [2024-10-11 17:55:09,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:09,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:09,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:09,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:55:09,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:09,459 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-11 17:55:09,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:09,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722107593] [2024-10-11 17:55:09,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722107593] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:09,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:09,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 17:55:09,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077444428] [2024-10-11 17:55:09,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:09,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:55:09,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:09,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:55:09,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:55:09,460 INFO L87 Difference]: Start difference. First operand 282 states and 394 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:09,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:09,524 INFO L93 Difference]: Finished difference Result 246 states and 326 transitions. [2024-10-11 17:55:09,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:55:09,524 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-10-11 17:55:09,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:09,525 INFO L225 Difference]: With dead ends: 246 [2024-10-11 17:55:09,525 INFO L226 Difference]: Without dead ends: 246 [2024-10-11 17:55:09,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:55:09,525 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 36 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:09,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 637 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:09,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-10-11 17:55:09,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2024-10-11 17:55:09,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 185 states have (on average 1.6972972972972973) internal successors, (314), 236 states have internal predecessors, (314), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 17:55:09,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 326 transitions. [2024-10-11 17:55:09,532 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 326 transitions. Word has length 22 [2024-10-11 17:55:09,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:09,532 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 326 transitions. [2024-10-11 17:55:09,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:09,533 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 326 transitions. [2024-10-11 17:55:09,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 17:55:09,533 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:09,533 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:09,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 17:55:09,533 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:55:09,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:09,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1261017870, now seen corresponding path program 1 times [2024-10-11 17:55:09,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:09,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532033784] [2024-10-11 17:55:09,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:09,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:09,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:09,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:55:09,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:09,625 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-11 17:55:09,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:09,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532033784] [2024-10-11 17:55:09,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532033784] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:09,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:09,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:55:09,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816079855] [2024-10-11 17:55:09,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:09,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:55:09,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:09,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:55:09,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:55:09,627 INFO L87 Difference]: Start difference. First operand 246 states and 326 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:09,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:09,725 INFO L93 Difference]: Finished difference Result 245 states and 323 transitions. [2024-10-11 17:55:09,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:55:09,725 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-10-11 17:55:09,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:09,727 INFO L225 Difference]: With dead ends: 245 [2024-10-11 17:55:09,727 INFO L226 Difference]: Without dead ends: 245 [2024-10-11 17:55:09,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:55:09,728 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 19 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:09,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 449 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:09,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-10-11 17:55:09,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2024-10-11 17:55:09,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 185 states have (on average 1.681081081081081) internal successors, (311), 235 states have internal predecessors, (311), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 17:55:09,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 323 transitions. [2024-10-11 17:55:09,736 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 323 transitions. Word has length 23 [2024-10-11 17:55:09,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:09,736 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 323 transitions. [2024-10-11 17:55:09,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:09,737 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 323 transitions. [2024-10-11 17:55:09,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 17:55:09,737 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:09,737 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:09,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 17:55:09,738 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:55:09,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:09,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1261018063, now seen corresponding path program 1 times [2024-10-11 17:55:09,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:09,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679974327] [2024-10-11 17:55:09,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:09,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:09,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:09,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:55:09,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:09,826 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-11 17:55:09,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:09,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679974327] [2024-10-11 17:55:09,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679974327] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:09,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:09,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:55:09,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852118706] [2024-10-11 17:55:09,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:09,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:55:09,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:09,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:55:09,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:55:09,827 INFO L87 Difference]: Start difference. First operand 245 states and 323 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:09,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:09,929 INFO L93 Difference]: Finished difference Result 272 states and 357 transitions. [2024-10-11 17:55:09,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:55:09,929 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-10-11 17:55:09,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:09,930 INFO L225 Difference]: With dead ends: 272 [2024-10-11 17:55:09,930 INFO L226 Difference]: Without dead ends: 272 [2024-10-11 17:55:09,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:55:09,931 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 7 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:09,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 474 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:09,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-10-11 17:55:09,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 266. [2024-10-11 17:55:09,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 206 states have (on average 1.6359223300970873) internal successors, (337), 256 states have internal predecessors, (337), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 17:55:09,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 349 transitions. [2024-10-11 17:55:09,936 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 349 transitions. Word has length 23 [2024-10-11 17:55:09,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:09,936 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 349 transitions. [2024-10-11 17:55:09,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:09,936 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 349 transitions. [2024-10-11 17:55:09,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 17:55:09,936 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:09,936 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:09,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 17:55:09,937 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:55:09,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:09,937 INFO L85 PathProgramCache]: Analyzing trace with hash -187260227, now seen corresponding path program 1 times [2024-10-11 17:55:09,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:09,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108975848] [2024-10-11 17:55:09,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:09,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:09,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:09,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:55:09,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:09,990 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-11 17:55:09,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:09,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108975848] [2024-10-11 17:55:09,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108975848] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:09,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:09,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:55:09,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971674796] [2024-10-11 17:55:09,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:09,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:55:09,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:09,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:55:09,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:55:09,991 INFO L87 Difference]: Start difference. First operand 266 states and 349 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:10,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:10,095 INFO L93 Difference]: Finished difference Result 267 states and 349 transitions. [2024-10-11 17:55:10,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:55:10,096 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-10-11 17:55:10,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:10,097 INFO L225 Difference]: With dead ends: 267 [2024-10-11 17:55:10,097 INFO L226 Difference]: Without dead ends: 267 [2024-10-11 17:55:10,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:55:10,098 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 44 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:10,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 378 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:10,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-10-11 17:55:10,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 265. [2024-10-11 17:55:10,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 206 states have (on average 1.6262135922330097) internal successors, (335), 255 states have internal predecessors, (335), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 17:55:10,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 347 transitions. [2024-10-11 17:55:10,104 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 347 transitions. Word has length 27 [2024-10-11 17:55:10,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:10,104 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 347 transitions. [2024-10-11 17:55:10,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:10,105 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 347 transitions. [2024-10-11 17:55:10,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 17:55:10,105 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:10,105 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:10,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 17:55:10,105 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:55:10,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:10,106 INFO L85 PathProgramCache]: Analyzing trace with hash -187260226, now seen corresponding path program 1 times [2024-10-11 17:55:10,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:10,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973638362] [2024-10-11 17:55:10,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:10,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:10,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:10,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:55:10,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:10,235 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-11 17:55:10,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:10,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973638362] [2024-10-11 17:55:10,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973638362] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:10,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:10,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:55:10,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830410514] [2024-10-11 17:55:10,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:10,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:55:10,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:10,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:55:10,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:55:10,237 INFO L87 Difference]: Start difference. First operand 265 states and 347 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:10,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:10,354 INFO L93 Difference]: Finished difference Result 266 states and 347 transitions. [2024-10-11 17:55:10,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:55:10,355 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-10-11 17:55:10,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:10,356 INFO L225 Difference]: With dead ends: 266 [2024-10-11 17:55:10,356 INFO L226 Difference]: Without dead ends: 266 [2024-10-11 17:55:10,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:55:10,357 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 36 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:10,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 378 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:10,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-10-11 17:55:10,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 264. [2024-10-11 17:55:10,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 206 states have (on average 1.616504854368932) internal successors, (333), 254 states have internal predecessors, (333), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 17:55:10,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 345 transitions. [2024-10-11 17:55:10,364 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 345 transitions. Word has length 27 [2024-10-11 17:55:10,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:10,364 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 345 transitions. [2024-10-11 17:55:10,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:10,365 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 345 transitions. [2024-10-11 17:55:10,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 17:55:10,365 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:10,365 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:10,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 17:55:10,365 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:55:10,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:10,366 INFO L85 PathProgramCache]: Analyzing trace with hash 431551966, now seen corresponding path program 1 times [2024-10-11 17:55:10,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:10,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559774618] [2024-10-11 17:55:10,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:10,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:10,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:10,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:55:10,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:10,476 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-11 17:55:10,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:10,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559774618] [2024-10-11 17:55:10,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559774618] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:10,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:10,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:55:10,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619409659] [2024-10-11 17:55:10,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:10,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:55:10,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:10,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:55:10,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:55:10,478 INFO L87 Difference]: Start difference. First operand 264 states and 345 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:10,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:10,642 INFO L93 Difference]: Finished difference Result 293 states and 381 transitions. [2024-10-11 17:55:10,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:55:10,643 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2024-10-11 17:55:10,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:10,644 INFO L225 Difference]: With dead ends: 293 [2024-10-11 17:55:10,644 INFO L226 Difference]: Without dead ends: 293 [2024-10-11 17:55:10,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:55:10,644 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 53 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:10,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 382 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:55:10,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-10-11 17:55:10,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 261. [2024-10-11 17:55:10,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 206 states have (on average 1.587378640776699) internal successors, (327), 251 states have internal predecessors, (327), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 17:55:10,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 339 transitions. [2024-10-11 17:55:10,649 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 339 transitions. Word has length 29 [2024-10-11 17:55:10,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:10,650 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 339 transitions. [2024-10-11 17:55:10,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:10,650 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 339 transitions. [2024-10-11 17:55:10,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 17:55:10,650 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:10,650 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:10,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 17:55:10,651 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:55:10,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:10,651 INFO L85 PathProgramCache]: Analyzing trace with hash 431551967, now seen corresponding path program 1 times [2024-10-11 17:55:10,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:10,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9495242] [2024-10-11 17:55:10,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:10,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:10,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:10,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:55:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:10,812 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-11 17:55:10,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:10,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9495242] [2024-10-11 17:55:10,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9495242] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:10,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:10,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:55:10,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024649001] [2024-10-11 17:55:10,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:10,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:55:10,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:10,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:55:10,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:55:10,815 INFO L87 Difference]: Start difference. First operand 261 states and 339 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:10,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:10,977 INFO L93 Difference]: Finished difference Result 292 states and 379 transitions. [2024-10-11 17:55:10,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:55:10,977 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2024-10-11 17:55:10,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:10,978 INFO L225 Difference]: With dead ends: 292 [2024-10-11 17:55:10,978 INFO L226 Difference]: Without dead ends: 292 [2024-10-11 17:55:10,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-11 17:55:10,979 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 243 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:10,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 362 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:10,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-10-11 17:55:10,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 260. [2024-10-11 17:55:10,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 206 states have (on average 1.5776699029126213) internal successors, (325), 250 states have internal predecessors, (325), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 17:55:10,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 337 transitions. [2024-10-11 17:55:10,983 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 337 transitions. Word has length 29 [2024-10-11 17:55:10,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:10,983 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 337 transitions. [2024-10-11 17:55:10,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:10,983 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 337 transitions. [2024-10-11 17:55:10,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 17:55:10,983 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:10,983 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:10,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 17:55:10,983 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:55:10,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:10,984 INFO L85 PathProgramCache]: Analyzing trace with hash 431552128, now seen corresponding path program 1 times [2024-10-11 17:55:10,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:10,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867571907] [2024-10-11 17:55:10,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:10,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:10,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:11,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:55:11,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:11,228 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-11 17:55:11,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:11,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867571907] [2024-10-11 17:55:11,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867571907] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:11,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:11,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 17:55:11,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422986110] [2024-10-11 17:55:11,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:11,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:55:11,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:11,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:55:11,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:55:11,229 INFO L87 Difference]: Start difference. First operand 260 states and 337 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:11,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:11,539 INFO L93 Difference]: Finished difference Result 327 states and 384 transitions. [2024-10-11 17:55:11,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 17:55:11,539 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2024-10-11 17:55:11,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:11,540 INFO L225 Difference]: With dead ends: 327 [2024-10-11 17:55:11,540 INFO L226 Difference]: Without dead ends: 327 [2024-10-11 17:55:11,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-11 17:55:11,541 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 229 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:11,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 453 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:55:11,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-10-11 17:55:11,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 260. [2024-10-11 17:55:11,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 206 states have (on average 1.5679611650485437) internal successors, (323), 250 states have internal predecessors, (323), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 17:55:11,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 335 transitions. [2024-10-11 17:55:11,545 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 335 transitions. Word has length 29 [2024-10-11 17:55:11,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:11,545 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 335 transitions. [2024-10-11 17:55:11,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:11,545 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 335 transitions. [2024-10-11 17:55:11,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 17:55:11,545 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:11,546 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:11,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 17:55:11,546 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:55:11,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:11,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1044600501, now seen corresponding path program 1 times [2024-10-11 17:55:11,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:11,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091589161] [2024-10-11 17:55:11,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:11,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:11,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:11,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:55:11,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:11,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 17:55:11,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:11,607 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 17:55:11,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:11,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091589161] [2024-10-11 17:55:11,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091589161] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:55:11,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197787737] [2024-10-11 17:55:11,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:11,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:55:11,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:55:11,610 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:55:11,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 17:55:11,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:11,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 17:55:11,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:55:11,795 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:11,796 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:55:11,856 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 17:55:11,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197787737] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:55:11,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:55:11,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-10-11 17:55:11,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590901354] [2024-10-11 17:55:11,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:55:11,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:55:11,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:11,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:55:11,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:55:11,858 INFO L87 Difference]: Start difference. First operand 260 states and 335 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-11 17:55:12,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:12,005 INFO L93 Difference]: Finished difference Result 1008 states and 1335 transitions. [2024-10-11 17:55:12,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 17:55:12,006 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 43 [2024-10-11 17:55:12,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:12,009 INFO L225 Difference]: With dead ends: 1008 [2024-10-11 17:55:12,009 INFO L226 Difference]: Without dead ends: 1008 [2024-10-11 17:55:12,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2024-10-11 17:55:12,009 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 582 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:12,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [588 Valid, 789 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:12,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2024-10-11 17:55:12,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 560. [2024-10-11 17:55:12,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 500 states have (on average 1.576) internal successors, (788), 544 states have internal predecessors, (788), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 17:55:12,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 812 transitions. [2024-10-11 17:55:12,020 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 812 transitions. Word has length 43 [2024-10-11 17:55:12,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:12,020 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 812 transitions. [2024-10-11 17:55:12,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-11 17:55:12,020 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 812 transitions. [2024-10-11 17:55:12,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 17:55:12,021 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:12,021 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:12,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 17:55:12,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-10-11 17:55:12,222 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:55:12,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:12,222 INFO L85 PathProgramCache]: Analyzing trace with hash 343535923, now seen corresponding path program 1 times [2024-10-11 17:55:12,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:12,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723561195] [2024-10-11 17:55:12,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:12,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:12,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:12,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:55:12,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:12,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 17:55:12,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:12,417 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 17:55:12,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:12,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723561195] [2024-10-11 17:55:12,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723561195] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:12,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:12,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:55:12,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758965866] [2024-10-11 17:55:12,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:12,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:55:12,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:12,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:55:12,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:55:12,419 INFO L87 Difference]: Start difference. First operand 560 states and 812 transitions. Second operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:55:12,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:12,556 INFO L93 Difference]: Finished difference Result 565 states and 812 transitions. [2024-10-11 17:55:12,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 17:55:12,556 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2024-10-11 17:55:12,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:12,558 INFO L225 Difference]: With dead ends: 565 [2024-10-11 17:55:12,559 INFO L226 Difference]: Without dead ends: 565 [2024-10-11 17:55:12,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:55:12,559 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 233 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:12,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 263 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:12,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2024-10-11 17:55:12,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 557. [2024-10-11 17:55:12,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 500 states have (on average 1.56) internal successors, (780), 541 states have internal predecessors, (780), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 17:55:12,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 804 transitions. [2024-10-11 17:55:12,567 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 804 transitions. Word has length 43 [2024-10-11 17:55:12,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:12,567 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 804 transitions. [2024-10-11 17:55:12,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:55:12,567 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 804 transitions. [2024-10-11 17:55:12,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 17:55:12,568 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:12,568 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:12,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-11 17:55:12,568 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:55:12,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:12,568 INFO L85 PathProgramCache]: Analyzing trace with hash -851884075, now seen corresponding path program 1 times [2024-10-11 17:55:12,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:12,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517586036] [2024-10-11 17:55:12,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:12,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:12,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:12,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:55:12,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:12,619 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 17:55:12,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:12,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517586036] [2024-10-11 17:55:12,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517586036] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:12,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:12,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:55:12,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084786004] [2024-10-11 17:55:12,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:12,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:55:12,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:12,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:55:12,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:55:12,622 INFO L87 Difference]: Start difference. First operand 557 states and 804 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:12,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:12,671 INFO L93 Difference]: Finished difference Result 637 states and 898 transitions. [2024-10-11 17:55:12,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:55:12,672 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2024-10-11 17:55:12,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:12,674 INFO L225 Difference]: With dead ends: 637 [2024-10-11 17:55:12,674 INFO L226 Difference]: Without dead ends: 637 [2024-10-11 17:55:12,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:55:12,675 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 105 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:12,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 303 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:55:12,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-10-11 17:55:12,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 563. [2024-10-11 17:55:12,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 506 states have (on average 1.5533596837944663) internal successors, (786), 547 states have internal predecessors, (786), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 17:55:12,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 810 transitions. [2024-10-11 17:55:12,684 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 810 transitions. Word has length 44 [2024-10-11 17:55:12,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:12,685 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 810 transitions. [2024-10-11 17:55:12,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:12,685 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 810 transitions. [2024-10-11 17:55:12,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 17:55:12,685 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:12,685 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:12,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-11 17:55:12,685 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:55:12,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:12,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1531942445, now seen corresponding path program 1 times [2024-10-11 17:55:12,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:12,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041650608] [2024-10-11 17:55:12,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:12,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:12,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:12,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:55:12,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:12,770 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 17:55:12,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:12,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041650608] [2024-10-11 17:55:12,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041650608] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:55:12,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306392369] [2024-10-11 17:55:12,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:12,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:55:12,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:55:12,773 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:55:12,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 17:55:12,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:12,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 17:55:12,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:55:12,938 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 17:55:12,939 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:55:12,997 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 17:55:12,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306392369] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:55:12,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:55:12,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-11 17:55:12,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546639790] [2024-10-11 17:55:12,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:55:12,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 17:55:12,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:12,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 17:55:12,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:55:12,999 INFO L87 Difference]: Start difference. First operand 563 states and 810 transitions. Second operand has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 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-11 17:55:13,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:13,138 INFO L93 Difference]: Finished difference Result 1979 states and 2834 transitions. [2024-10-11 17:55:13,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 17:55:13,139 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 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) Word has length 44 [2024-10-11 17:55:13,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:13,144 INFO L225 Difference]: With dead ends: 1979 [2024-10-11 17:55:13,145 INFO L226 Difference]: Without dead ends: 1979 [2024-10-11 17:55:13,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-10-11 17:55:13,145 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 379 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:13,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 867 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:13,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1979 states. [2024-10-11 17:55:13,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1979 to 1346. [2024-10-11 17:55:13,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1346 states, 1270 states have (on average 1.5401574803149607) internal successors, (1956), 1311 states have internal predecessors, (1956), 31 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-11 17:55:13,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 2018 transitions. [2024-10-11 17:55:13,179 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 2018 transitions. Word has length 44 [2024-10-11 17:55:13,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:13,180 INFO L471 AbstractCegarLoop]: Abstraction has 1346 states and 2018 transitions. [2024-10-11 17:55:13,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 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-11 17:55:13,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 2018 transitions. [2024-10-11 17:55:13,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 17:55:13,181 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:13,181 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:13,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 17:55:13,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:55:13,384 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:55:13,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:13,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1533789487, now seen corresponding path program 1 times [2024-10-11 17:55:13,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:13,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313274025] [2024-10-11 17:55:13,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:13,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:13,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:13,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:55:13,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:13,514 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:13,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:13,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313274025] [2024-10-11 17:55:13,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313274025] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:13,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:13,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:55:13,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515974104] [2024-10-11 17:55:13,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:13,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:55:13,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:13,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:55:13,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:55:13,516 INFO L87 Difference]: Start difference. First operand 1346 states and 2018 transitions. Second operand has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:13,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:13,641 INFO L93 Difference]: Finished difference Result 1369 states and 2041 transitions. [2024-10-11 17:55:13,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 17:55:13,642 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2024-10-11 17:55:13,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:13,645 INFO L225 Difference]: With dead ends: 1369 [2024-10-11 17:55:13,645 INFO L226 Difference]: Without dead ends: 1369 [2024-10-11 17:55:13,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:55:13,646 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 117 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:13,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 242 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:13,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2024-10-11 17:55:13,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 1348. [2024-10-11 17:55:13,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1348 states, 1272 states have (on average 1.5400943396226414) internal successors, (1959), 1313 states have internal predecessors, (1959), 31 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-11 17:55:13,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 2021 transitions. [2024-10-11 17:55:13,669 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 2021 transitions. Word has length 44 [2024-10-11 17:55:13,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:13,670 INFO L471 AbstractCegarLoop]: Abstraction has 1348 states and 2021 transitions. [2024-10-11 17:55:13,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:13,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 2021 transitions. [2024-10-11 17:55:13,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 17:55:13,670 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:13,671 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:13,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-11 17:55:13,671 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:55:13,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:13,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1533789425, now seen corresponding path program 1 times [2024-10-11 17:55:13,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:13,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467727288] [2024-10-11 17:55:13,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:13,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:13,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:13,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:55:13,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:13,877 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:13,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:13,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467727288] [2024-10-11 17:55:13,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467727288] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:55:13,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634864182] [2024-10-11 17:55:13,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:13,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:55:13,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:55:13,880 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:55:13,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 17:55:13,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:13,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-11 17:55:13,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:55:14,295 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:14,295 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:55:14,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634864182] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:14,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 17:55:14,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 15 [2024-10-11 17:55:14,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761633949] [2024-10-11 17:55:14,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:14,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 17:55:14,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:14,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 17:55:14,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2024-10-11 17:55:14,297 INFO L87 Difference]: Start difference. First operand 1348 states and 2021 transitions. Second operand has 9 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:14,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:14,561 INFO L93 Difference]: Finished difference Result 1551 states and 2359 transitions. [2024-10-11 17:55:14,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 17:55:14,561 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2024-10-11 17:55:14,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:14,565 INFO L225 Difference]: With dead ends: 1551 [2024-10-11 17:55:14,565 INFO L226 Difference]: Without dead ends: 1551 [2024-10-11 17:55:14,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2024-10-11 17:55:14,566 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 340 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:14,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 502 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:55:14,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1551 states. [2024-10-11 17:55:14,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1551 to 1345. [2024-10-11 17:55:14,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1345 states, 1270 states have (on average 1.5385826771653544) internal successors, (1954), 1310 states have internal predecessors, (1954), 31 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-11 17:55:14,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 2016 transitions. [2024-10-11 17:55:14,584 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 2016 transitions. Word has length 44 [2024-10-11 17:55:14,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:14,584 INFO L471 AbstractCegarLoop]: Abstraction has 1345 states and 2016 transitions. [2024-10-11 17:55:14,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:14,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 2016 transitions. [2024-10-11 17:55:14,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 17:55:14,585 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:14,585 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:14,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 17:55:14,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:55:14,786 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:55:14,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:14,787 INFO L85 PathProgramCache]: Analyzing trace with hash -623672017, now seen corresponding path program 1 times [2024-10-11 17:55:14,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:14,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528393362] [2024-10-11 17:55:14,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:14,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:14,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:14,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:55:14,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:14,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 17:55:14,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:14,904 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 17:55:14,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:14,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528393362] [2024-10-11 17:55:14,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528393362] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:14,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:14,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:55:14,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971864339] [2024-10-11 17:55:14,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:14,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:55:14,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:14,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:55:14,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:55:14,906 INFO L87 Difference]: Start difference. First operand 1345 states and 2016 transitions. Second operand has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 17:55:15,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:15,008 INFO L93 Difference]: Finished difference Result 1364 states and 2033 transitions. [2024-10-11 17:55:15,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:55:15,008 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2024-10-11 17:55:15,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:15,018 INFO L225 Difference]: With dead ends: 1364 [2024-10-11 17:55:15,018 INFO L226 Difference]: Without dead ends: 1364 [2024-10-11 17:55:15,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:55:15,018 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 114 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:15,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 428 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:15,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2024-10-11 17:55:15,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1344. [2024-10-11 17:55:15,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1344 states, 1270 states have (on average 1.536220472440945) internal successors, (1951), 1309 states have internal predecessors, (1951), 31 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-11 17:55:15,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 2013 transitions. [2024-10-11 17:55:15,037 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 2013 transitions. Word has length 46 [2024-10-11 17:55:15,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:15,037 INFO L471 AbstractCegarLoop]: Abstraction has 1344 states and 2013 transitions. [2024-10-11 17:55:15,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 17:55:15,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 2013 transitions. [2024-10-11 17:55:15,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 17:55:15,038 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:15,038 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:15,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-11 17:55:15,039 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:55:15,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:15,039 INFO L85 PathProgramCache]: Analyzing trace with hash -797869352, now seen corresponding path program 1 times [2024-10-11 17:55:15,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:15,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678110419] [2024-10-11 17:55:15,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:15,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:15,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:15,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:55:15,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:15,659 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:15,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:15,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678110419] [2024-10-11 17:55:15,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678110419] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:15,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:15,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 17:55:15,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768475789] [2024-10-11 17:55:15,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:15,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 17:55:15,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:15,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 17:55:15,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-11 17:55:15,662 INFO L87 Difference]: Start difference. First operand 1344 states and 2013 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:15,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:15,993 INFO L93 Difference]: Finished difference Result 1370 states and 2040 transitions. [2024-10-11 17:55:15,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 17:55:15,993 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2024-10-11 17:55:15,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:15,997 INFO L225 Difference]: With dead ends: 1370 [2024-10-11 17:55:15,997 INFO L226 Difference]: Without dead ends: 1370 [2024-10-11 17:55:15,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2024-10-11 17:55:15,997 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 39 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:15,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 669 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:55:15,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2024-10-11 17:55:16,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1368. [2024-10-11 17:55:16,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1368 states, 1294 states have (on average 1.527047913446677) internal successors, (1976), 1333 states have internal predecessors, (1976), 31 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-11 17:55:16,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 2038 transitions. [2024-10-11 17:55:16,014 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 2038 transitions. Word has length 46 [2024-10-11 17:55:16,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:16,015 INFO L471 AbstractCegarLoop]: Abstraction has 1368 states and 2038 transitions. [2024-10-11 17:55:16,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:16,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 2038 transitions. [2024-10-11 17:55:16,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-11 17:55:16,015 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:16,015 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:16,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-11 17:55:16,016 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:55:16,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:16,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1369035373, now seen corresponding path program 1 times [2024-10-11 17:55:16,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:16,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463233360] [2024-10-11 17:55:16,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:16,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:16,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:16,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:55:16,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:16,551 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:16,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:16,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463233360] [2024-10-11 17:55:16,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463233360] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:16,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:16,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 17:55:16,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210778191] [2024-10-11 17:55:16,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:16,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 17:55:16,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:16,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 17:55:16,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-10-11 17:55:16,553 INFO L87 Difference]: Start difference. First operand 1368 states and 2038 transitions. Second operand has 13 states, 12 states have (on average 3.75) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:16,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:16,936 INFO L93 Difference]: Finished difference Result 2483 states and 3780 transitions. [2024-10-11 17:55:16,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 17:55:16,936 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2024-10-11 17:55:16,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:16,943 INFO L225 Difference]: With dead ends: 2483 [2024-10-11 17:55:16,943 INFO L226 Difference]: Without dead ends: 2483 [2024-10-11 17:55:16,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2024-10-11 17:55:16,944 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 317 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:16,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 873 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 17:55:16,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2483 states. [2024-10-11 17:55:16,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2483 to 1846. [2024-10-11 17:55:16,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1846 states, 1748 states have (on average 1.5280320366132722) internal successors, (2671), 1804 states have internal predecessors, (2671), 54 states have call successors, (54), 5 states have call predecessors, (54), 5 states have return successors, (54), 36 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-11 17:55:16,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1846 states to 1846 states and 2779 transitions. [2024-10-11 17:55:16,998 INFO L78 Accepts]: Start accepts. Automaton has 1846 states and 2779 transitions. Word has length 47 [2024-10-11 17:55:16,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:16,999 INFO L471 AbstractCegarLoop]: Abstraction has 1846 states and 2779 transitions. [2024-10-11 17:55:16,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:16,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1846 states and 2779 transitions. [2024-10-11 17:55:17,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-11 17:55:17,000 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:17,000 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:17,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-11 17:55:17,000 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:55:17,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:17,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1369035372, now seen corresponding path program 1 times [2024-10-11 17:55:17,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:17,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781762084] [2024-10-11 17:55:17,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:17,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:17,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:17,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:55:17,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:17,643 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:17,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:17,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781762084] [2024-10-11 17:55:17,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781762084] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:17,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:17,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 17:55:17,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956730991] [2024-10-11 17:55:17,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:17,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 17:55:17,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:17,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 17:55:17,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-10-11 17:55:17,645 INFO L87 Difference]: Start difference. First operand 1846 states and 2779 transitions. Second operand has 13 states, 12 states have (on average 3.75) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:18,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:18,188 INFO L93 Difference]: Finished difference Result 2603 states and 3968 transitions. [2024-10-11 17:55:18,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 17:55:18,188 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2024-10-11 17:55:18,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:18,195 INFO L225 Difference]: With dead ends: 2603 [2024-10-11 17:55:18,195 INFO L226 Difference]: Without dead ends: 2603 [2024-10-11 17:55:18,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2024-10-11 17:55:18,196 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 352 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:18,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 1046 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 17:55:18,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2603 states. [2024-10-11 17:55:18,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2603 to 1965. [2024-10-11 17:55:18,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1965 states, 1861 states have (on average 1.5325094035464804) internal successors, (2852), 1919 states have internal predecessors, (2852), 59 states have call successors, (59), 6 states have call predecessors, (59), 6 states have return successors, (59), 39 states have call predecessors, (59), 59 states have call successors, (59) [2024-10-11 17:55:18,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 2970 transitions. [2024-10-11 17:55:18,222 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 2970 transitions. Word has length 47 [2024-10-11 17:55:18,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:18,223 INFO L471 AbstractCegarLoop]: Abstraction has 1965 states and 2970 transitions. [2024-10-11 17:55:18,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:18,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 2970 transitions. [2024-10-11 17:55:18,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-11 17:55:18,223 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:18,223 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:18,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-11 17:55:18,224 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:55:18,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:18,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1368975791, now seen corresponding path program 1 times [2024-10-11 17:55:18,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:18,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705393490] [2024-10-11 17:55:18,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:18,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:18,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:18,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:55:18,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:18,418 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:18,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:18,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705393490] [2024-10-11 17:55:18,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705393490] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:18,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:18,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 17:55:18,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448467055] [2024-10-11 17:55:18,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:18,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 17:55:18,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:18,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 17:55:18,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 17:55:18,420 INFO L87 Difference]: Start difference. First operand 1965 states and 2970 transitions. Second operand has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:18,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:18,637 INFO L93 Difference]: Finished difference Result 2951 states and 4478 transitions. [2024-10-11 17:55:18,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 17:55:18,638 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2024-10-11 17:55:18,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:18,651 INFO L225 Difference]: With dead ends: 2951 [2024-10-11 17:55:18,651 INFO L226 Difference]: Without dead ends: 2951 [2024-10-11 17:55:18,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-10-11 17:55:18,652 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 179 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:18,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 623 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:55:18,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2024-10-11 17:55:18,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 2369. [2024-10-11 17:55:18,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2369 states, 2217 states have (on average 1.498872350022553) internal successors, (3323), 2309 states have internal predecessors, (3323), 103 states have call successors, (103), 10 states have call predecessors, (103), 10 states have return successors, (103), 49 states have call predecessors, (103), 103 states have call successors, (103) [2024-10-11 17:55:18,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2369 states to 2369 states and 3529 transitions. [2024-10-11 17:55:18,696 INFO L78 Accepts]: Start accepts. Automaton has 2369 states and 3529 transitions. Word has length 47 [2024-10-11 17:55:18,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:18,696 INFO L471 AbstractCegarLoop]: Abstraction has 2369 states and 3529 transitions. [2024-10-11 17:55:18,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:18,696 INFO L276 IsEmpty]: Start isEmpty. Operand 2369 states and 3529 transitions. [2024-10-11 17:55:18,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-11 17:55:18,697 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:18,697 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:18,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-10-11 17:55:18,697 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:55:18,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:18,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1368975790, now seen corresponding path program 1 times [2024-10-11 17:55:18,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:18,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214961225] [2024-10-11 17:55:18,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:18,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:18,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:19,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:55:19,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:19,222 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:19,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:19,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214961225] [2024-10-11 17:55:19,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214961225] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:19,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:19,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 17:55:19,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787271934] [2024-10-11 17:55:19,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:19,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 17:55:19,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:19,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 17:55:19,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-11 17:55:19,224 INFO L87 Difference]: Start difference. First operand 2369 states and 3529 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:19,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:19,625 INFO L93 Difference]: Finished difference Result 2531 states and 3732 transitions. [2024-10-11 17:55:19,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 17:55:19,626 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2024-10-11 17:55:19,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:19,633 INFO L225 Difference]: With dead ends: 2531 [2024-10-11 17:55:19,633 INFO L226 Difference]: Without dead ends: 2531 [2024-10-11 17:55:19,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2024-10-11 17:55:19,634 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 162 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:19,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 767 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 17:55:19,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2531 states. [2024-10-11 17:55:19,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2531 to 2390. [2024-10-11 17:55:19,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2390 states, 2239 states have (on average 1.492184010719071) internal successors, (3341), 2330 states have internal predecessors, (3341), 102 states have call successors, (102), 10 states have call predecessors, (102), 10 states have return successors, (102), 49 states have call predecessors, (102), 102 states have call successors, (102) [2024-10-11 17:55:19,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2390 states to 2390 states and 3545 transitions. [2024-10-11 17:55:19,667 INFO L78 Accepts]: Start accepts. Automaton has 2390 states and 3545 transitions. Word has length 47 [2024-10-11 17:55:19,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:19,667 INFO L471 AbstractCegarLoop]: Abstraction has 2390 states and 3545 transitions. [2024-10-11 17:55:19,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:19,667 INFO L276 IsEmpty]: Start isEmpty. Operand 2390 states and 3545 transitions. [2024-10-11 17:55:19,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 17:55:19,667 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:19,668 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:19,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-10-11 17:55:19,668 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:55:19,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:19,668 INFO L85 PathProgramCache]: Analyzing trace with hash -265052112, now seen corresponding path program 1 times [2024-10-11 17:55:19,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:19,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740154397] [2024-10-11 17:55:19,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:19,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:19,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:20,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:55:20,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:20,154 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:20,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:20,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740154397] [2024-10-11 17:55:20,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740154397] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:20,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:20,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-11 17:55:20,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63393143] [2024-10-11 17:55:20,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:20,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 17:55:20,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:20,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 17:55:20,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-10-11 17:55:20,156 INFO L87 Difference]: Start difference. First operand 2390 states and 3545 transitions. Second operand has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:20,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:20,590 INFO L93 Difference]: Finished difference Result 3476 states and 5187 transitions. [2024-10-11 17:55:20,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 17:55:20,591 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2024-10-11 17:55:20,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:20,598 INFO L225 Difference]: With dead ends: 3476 [2024-10-11 17:55:20,598 INFO L226 Difference]: Without dead ends: 3476 [2024-10-11 17:55:20,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2024-10-11 17:55:20,600 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 358 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:20,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 1065 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 17:55:20,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3476 states. [2024-10-11 17:55:20,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3476 to 2866. [2024-10-11 17:55:20,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2866 states, 2667 states have (on average 1.4653168353955754) internal successors, (3908), 2792 states have internal predecessors, (3908), 146 states have call successors, (146), 14 states have call predecessors, (146), 14 states have return successors, (146), 59 states have call predecessors, (146), 146 states have call successors, (146) [2024-10-11 17:55:20,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2866 states to 2866 states and 4200 transitions. [2024-10-11 17:55:20,645 INFO L78 Accepts]: Start accepts. Automaton has 2866 states and 4200 transitions. Word has length 48 [2024-10-11 17:55:20,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:20,645 INFO L471 AbstractCegarLoop]: Abstraction has 2866 states and 4200 transitions. [2024-10-11 17:55:20,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:20,645 INFO L276 IsEmpty]: Start isEmpty. Operand 2866 states and 4200 transitions. [2024-10-11 17:55:20,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 17:55:20,646 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:20,646 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:20,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-10-11 17:55:20,647 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:55:20,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:20,647 INFO L85 PathProgramCache]: Analyzing trace with hash -265052111, now seen corresponding path program 1 times [2024-10-11 17:55:20,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:20,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186777024] [2024-10-11 17:55:20,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:20,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:20,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:21,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:55:21,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:21,347 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:21,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:21,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186777024] [2024-10-11 17:55:21,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186777024] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:21,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:21,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-11 17:55:21,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531626312] [2024-10-11 17:55:21,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:21,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 17:55:21,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:21,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 17:55:21,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-10-11 17:55:21,348 INFO L87 Difference]: Start difference. First operand 2866 states and 4200 transitions. Second operand has 15 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:21,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:21,853 INFO L93 Difference]: Finished difference Result 3565 states and 5320 transitions. [2024-10-11 17:55:21,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 17:55:21,857 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2024-10-11 17:55:21,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:21,867 INFO L225 Difference]: With dead ends: 3565 [2024-10-11 17:55:21,867 INFO L226 Difference]: Without dead ends: 3565 [2024-10-11 17:55:21,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2024-10-11 17:55:21,868 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 376 mSDsluCounter, 1035 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 1153 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:21,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 1153 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 17:55:21,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3565 states. [2024-10-11 17:55:21,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3565 to 2558. [2024-10-11 17:55:21,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2558 states, 2393 states have (on average 1.4780610112829085) internal successors, (3537), 2494 states have internal predecessors, (3537), 115 states have call successors, (115), 11 states have call predecessors, (115), 11 states have return successors, (115), 52 states have call predecessors, (115), 115 states have call successors, (115) [2024-10-11 17:55:21,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2558 states to 2558 states and 3767 transitions. [2024-10-11 17:55:21,900 INFO L78 Accepts]: Start accepts. Automaton has 2558 states and 3767 transitions. Word has length 48 [2024-10-11 17:55:21,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:21,900 INFO L471 AbstractCegarLoop]: Abstraction has 2558 states and 3767 transitions. [2024-10-11 17:55:21,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:21,901 INFO L276 IsEmpty]: Start isEmpty. Operand 2558 states and 3767 transitions. [2024-10-11 17:55:21,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 17:55:21,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:21,901 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:21,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-10-11 17:55:21,901 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:55:21,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:21,902 INFO L85 PathProgramCache]: Analyzing trace with hash -264992529, now seen corresponding path program 1 times [2024-10-11 17:55:21,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:21,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343063960] [2024-10-11 17:55:21,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:21,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:21,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:22,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:55:22,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:22,772 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:22,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:22,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343063960] [2024-10-11 17:55:22,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343063960] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:55:22,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346714757] [2024-10-11 17:55:22,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:22,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:55:22,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:55:22,774 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:55:22,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 17:55:22,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:22,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-11 17:55:22,901 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:55:23,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 17:55:23,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 17:55:23,553 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:55:23,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2024-10-11 17:55:23,560 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:55:23,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2024-10-11 17:55:23,588 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:23,588 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:55:23,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346714757] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:23,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 17:55:23,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 22 [2024-10-11 17:55:23,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935651957] [2024-10-11 17:55:23,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:23,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 17:55:23,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:23,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 17:55:23,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2024-10-11 17:55:23,590 INFO L87 Difference]: Start difference. First operand 2558 states and 3767 transitions. Second operand has 11 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:23,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:23,906 INFO L93 Difference]: Finished difference Result 3269 states and 4778 transitions. [2024-10-11 17:55:23,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 17:55:23,906 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2024-10-11 17:55:23,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:23,911 INFO L225 Difference]: With dead ends: 3269 [2024-10-11 17:55:23,911 INFO L226 Difference]: Without dead ends: 3269 [2024-10-11 17:55:23,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2024-10-11 17:55:23,912 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 198 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:23,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 698 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 17:55:23,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3269 states. [2024-10-11 17:55:23,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3269 to 3160. [2024-10-11 17:55:23,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3160 states, 2949 states have (on average 1.4764326890471346) internal successors, (4354), 3078 states have internal predecessors, (4354), 156 states have call successors, (156), 16 states have call predecessors, (156), 16 states have return successors, (156), 65 states have call predecessors, (156), 156 states have call successors, (156) [2024-10-11 17:55:23,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3160 states to 3160 states and 4666 transitions. [2024-10-11 17:55:23,946 INFO L78 Accepts]: Start accepts. Automaton has 3160 states and 4666 transitions. Word has length 48 [2024-10-11 17:55:23,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:23,946 INFO L471 AbstractCegarLoop]: Abstraction has 3160 states and 4666 transitions. [2024-10-11 17:55:23,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 17:55:23,946 INFO L276 IsEmpty]: Start isEmpty. Operand 3160 states and 4666 transitions. [2024-10-11 17:55:23,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 17:55:23,947 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:23,947 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:23,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 17:55:24,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2024-10-11 17:55:24,148 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:55:24,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:24,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1478469438, now seen corresponding path program 1 times [2024-10-11 17:55:24,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:24,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832355333] [2024-10-11 17:55:24,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:24,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:24,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:24,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:55:24,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:24,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 17:55:24,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:24,482 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 17:55:24,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:24,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832355333] [2024-10-11 17:55:24,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832355333] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:24,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:24,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 17:55:24,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449905060] [2024-10-11 17:55:24,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:24,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 17:55:24,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:24,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 17:55:24,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 17:55:24,484 INFO L87 Difference]: Start difference. First operand 3160 states and 4666 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:55:24,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:24,753 INFO L93 Difference]: Finished difference Result 3711 states and 5522 transitions. [2024-10-11 17:55:24,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 17:55:24,754 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 49 [2024-10-11 17:55:24,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:24,759 INFO L225 Difference]: With dead ends: 3711 [2024-10-11 17:55:24,759 INFO L226 Difference]: Without dead ends: 3711 [2024-10-11 17:55:24,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-11 17:55:24,760 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 137 mSDsluCounter, 862 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:24,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 1002 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:55:24,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3711 states. [2024-10-11 17:55:24,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3711 to 3124. [2024-10-11 17:55:24,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3124 states, 2913 states have (on average 1.4685890834191555) internal successors, (4278), 3042 states have internal predecessors, (4278), 156 states have call successors, (156), 16 states have call predecessors, (156), 16 states have return successors, (156), 65 states have call predecessors, (156), 156 states have call successors, (156) [2024-10-11 17:55:24,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 4590 transitions. [2024-10-11 17:55:24,796 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 4590 transitions. Word has length 49 [2024-10-11 17:55:24,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:24,796 INFO L471 AbstractCegarLoop]: Abstraction has 3124 states and 4590 transitions. [2024-10-11 17:55:24,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 17:55:24,797 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 4590 transitions. [2024-10-11 17:55:24,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 17:55:24,797 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:24,797 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:24,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-10-11 17:55:24,798 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:55:24,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:24,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1338710335, now seen corresponding path program 1 times [2024-10-11 17:55:24,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:24,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307203570] [2024-10-11 17:55:24,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:24,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:24,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:25,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 17:55:25,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:25,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 17:55:25,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:25,340 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 17:55:25,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:25,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307203570] [2024-10-11 17:55:25,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307203570] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:55:25,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081896015] [2024-10-11 17:55:25,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:25,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:55:25,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:55:25,342 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:55:25,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 17:55:25,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:25,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-10-11 17:55:25,495 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:55:25,519 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-11 17:55:25,654 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-11 17:55:25,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2024-10-11 17:55:25,766 INFO L349 Elim1Store]: treesize reduction 42, result has 25.0 percent of original size [2024-10-11 17:55:25,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2024-10-11 17:55:29,931 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:55:29,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 12 [2024-10-11 17:55:29,943 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:29,943 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:55:30,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081896015] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:55:30,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:55:30,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 22 [2024-10-11 17:55:30,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058784129] [2024-10-11 17:55:30,033 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:55:30,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-11 17:55:30,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:30,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-11 17:55:30,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=570, Unknown=1, NotChecked=0, Total=650 [2024-10-11 17:55:30,035 INFO L87 Difference]: Start difference. First operand 3124 states and 4590 transitions. Second operand has 23 states, 22 states have (on average 3.9545454545454546) internal successors, (87), 20 states have internal predecessors, (87), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 17:55:38,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 17:55:46,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 17:55:50,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 17:55:54,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 17:55:58,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 17:56:02,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 17:56:06,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 17:56:10,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 17:56:14,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 17:56:26,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 17:56:30,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 17:56:34,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 17:56:35,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:56:35,426 INFO L93 Difference]: Finished difference Result 4523 states and 6800 transitions. [2024-10-11 17:56:35,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-11 17:56:35,427 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.9545454545454546) internal successors, (87), 20 states have internal predecessors, (87), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 49 [2024-10-11 17:56:35,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:56:35,434 INFO L225 Difference]: With dead ends: 4523 [2024-10-11 17:56:35,434 INFO L226 Difference]: Without dead ends: 4523 [2024-10-11 17:56:35,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 20.8s TimeCoverageRelationStatistics Valid=347, Invalid=1904, Unknown=5, NotChecked=0, Total=2256 [2024-10-11 17:56:35,435 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 973 mSDsluCounter, 1838 mSDsCounter, 0 mSdLazyCounter, 1564 mSolverCounterSat, 23 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 973 SdHoareTripleChecker+Valid, 1974 SdHoareTripleChecker+Invalid, 1599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1564 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 48.9s IncrementalHoareTripleChecker+Time [2024-10-11 17:56:35,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [973 Valid, 1974 Invalid, 1599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1564 Invalid, 12 Unknown, 0 Unchecked, 48.9s Time] [2024-10-11 17:56:35,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4523 states. [2024-10-11 17:56:35,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4523 to 3473. [2024-10-11 17:56:35,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3473 states, 3238 states have (on average 1.4549104385423102) internal successors, (4711), 3367 states have internal predecessors, (4711), 178 states have call successors, (178), 18 states have call predecessors, (178), 18 states have return successors, (178), 87 states have call predecessors, (178), 178 states have call successors, (178) [2024-10-11 17:56:35,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3473 states to 3473 states and 5067 transitions. [2024-10-11 17:56:35,490 INFO L78 Accepts]: Start accepts. Automaton has 3473 states and 5067 transitions. Word has length 49 [2024-10-11 17:56:35,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:56:35,490 INFO L471 AbstractCegarLoop]: Abstraction has 3473 states and 5067 transitions. [2024-10-11 17:56:35,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.9545454545454546) internal successors, (87), 20 states have internal predecessors, (87), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 17:56:35,490 INFO L276 IsEmpty]: Start isEmpty. Operand 3473 states and 5067 transitions. [2024-10-11 17:56:35,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 17:56:35,491 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:56:35,491 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:56:35,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 17:56:35,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2024-10-11 17:56:35,696 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2024-10-11 17:56:35,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:56:35,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1338710334, now seen corresponding path program 1 times [2024-10-11 17:56:35,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:56:35,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225520437] [2024-10-11 17:56:35,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:56:35,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:56:35,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat