./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/dll-middle-shared.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/memsafety-broom/dll-middle-shared.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash d8b0e8aa94f77bf1afa5295afab3fc9fce32b5bdbad38c3bd4a8f1e24260f6fc --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 18:07:34,419 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 18:07:34,528 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-10-11 18:07:34,536 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 18:07:34,537 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 18:07:34,556 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 18:07:34,557 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 18:07:34,558 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 18:07:34,559 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 18:07:34,559 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 18:07:34,560 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 18:07:34,560 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 18:07:34,561 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 18:07:34,561 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 18:07:34,562 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 18:07:34,562 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 18:07:34,563 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 18:07:34,563 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 18:07:34,564 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 18:07:34,564 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 18:07:34,564 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 18:07:34,567 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 18:07:34,567 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 18:07:34,568 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 18:07:34,568 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 18:07:34,568 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 18:07:34,569 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 18:07:34,569 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 18:07:34,569 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 18:07:34,569 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 18:07:34,570 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:07:34,574 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 18:07:34,575 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 18:07:34,575 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 18:07:34,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 18:07:34,576 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 18:07:34,576 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 18:07:34,576 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 18:07:34,576 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 18:07:34,577 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d8b0e8aa94f77bf1afa5295afab3fc9fce32b5bdbad38c3bd4a8f1e24260f6fc [2024-10-11 18:07:34,886 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 18:07:34,914 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 18:07:34,918 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 18:07:34,919 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 18:07:34,919 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 18:07:34,920 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/dll-middle-shared.i [2024-10-11 18:07:36,567 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 18:07:36,859 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 18:07:36,860 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/dll-middle-shared.i [2024-10-11 18:07:36,889 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fec89b859/05f10a832add4d7a8ee5cb566f6d07c0/FLAG931930ba8 [2024-10-11 18:07:36,903 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fec89b859/05f10a832add4d7a8ee5cb566f6d07c0 [2024-10-11 18:07:36,906 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 18:07:36,909 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 18:07:36,911 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 18:07:36,912 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 18:07:36,921 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 18:07:36,922 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:07:36" (1/1) ... [2024-10-11 18:07:36,923 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75d5a17c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:36, skipping insertion in model container [2024-10-11 18:07:36,923 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:07:36" (1/1) ... [2024-10-11 18:07:36,984 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 18:07:37,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:07:37,400 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 18:07:37,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:07:37,500 INFO L204 MainTranslator]: Completed translation [2024-10-11 18:07:37,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:37 WrapperNode [2024-10-11 18:07:37,501 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 18:07:37,503 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 18:07:37,503 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 18:07:37,503 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 18:07:37,510 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:37" (1/1) ... [2024-10-11 18:07:37,536 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:37" (1/1) ... [2024-10-11 18:07:37,586 INFO L138 Inliner]: procedures = 121, calls = 34, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 99 [2024-10-11 18:07:37,587 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 18:07:37,588 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 18:07:37,588 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 18:07:37,588 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 18:07:37,600 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:37" (1/1) ... [2024-10-11 18:07:37,600 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:37" (1/1) ... [2024-10-11 18:07:37,611 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:37" (1/1) ... [2024-10-11 18:07:37,662 INFO L175 MemorySlicer]: Split 20 memory accesses to 1 slices as follows [20]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 10 writes are split as follows [10]. [2024-10-11 18:07:37,662 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:37" (1/1) ... [2024-10-11 18:07:37,662 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:37" (1/1) ... [2024-10-11 18:07:37,669 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:37" (1/1) ... [2024-10-11 18:07:37,673 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:37" (1/1) ... [2024-10-11 18:07:37,680 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:37" (1/1) ... [2024-10-11 18:07:37,681 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:37" (1/1) ... [2024-10-11 18:07:37,686 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 18:07:37,687 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 18:07:37,687 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 18:07:37,687 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 18:07:37,688 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:37" (1/1) ... [2024-10-11 18:07:37,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:07:37,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:07:37,730 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 18:07:37,733 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 18:07:37,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 18:07:37,791 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2024-10-11 18:07:37,791 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2024-10-11 18:07:37,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 18:07:37,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 18:07:37,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 18:07:37,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 18:07:37,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 18:07:37,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 18:07:37,961 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 18:07:37,966 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 18:07:38,429 INFO L? ?]: Removed 118 outVars from TransFormulas that were not future-live. [2024-10-11 18:07:38,433 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 18:07:38,497 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 18:07:38,499 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-11 18:07:38,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:07:38 BoogieIcfgContainer [2024-10-11 18:07:38,500 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 18:07:38,503 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 18:07:38,503 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 18:07:38,508 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 18:07:38,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:07:36" (1/3) ... [2024-10-11 18:07:38,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@563f10bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:07:38, skipping insertion in model container [2024-10-11 18:07:38,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:07:37" (2/3) ... [2024-10-11 18:07:38,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@563f10bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:07:38, skipping insertion in model container [2024-10-11 18:07:38,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:07:38" (3/3) ... [2024-10-11 18:07:38,512 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-middle-shared.i [2024-10-11 18:07:38,531 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 18:07:38,532 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 50 error locations. [2024-10-11 18:07:38,591 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 18:07:38,600 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;@6a196bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 18:07:38,601 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2024-10-11 18:07:38,607 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 41 states have (on average 2.3902439024390243) internal successors, (98), 91 states have internal predecessors, (98), 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 18:07:38,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 18:07:38,616 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:38,618 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 18:07:38,619 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-11 18:07:38,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:38,626 INFO L85 PathProgramCache]: Analyzing trace with hash 6012979, now seen corresponding path program 1 times [2024-10-11 18:07:38,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:38,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137882611] [2024-10-11 18:07:38,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:38,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:38,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:38,863 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 18:07:38,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:38,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137882611] [2024-10-11 18:07:38,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137882611] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:38,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:38,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:07:38,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398762560] [2024-10-11 18:07:38,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:38,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:07:38,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:38,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:07:38,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:07:38,910 INFO L87 Difference]: Start difference. First operand has 95 states, 41 states have (on average 2.3902439024390243) internal successors, (98), 91 states have internal predecessors, (98), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:07:39,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:39,073 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2024-10-11 18:07:39,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:07:39,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 18:07:39,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:39,089 INFO L225 Difference]: With dead ends: 93 [2024-10-11 18:07:39,090 INFO L226 Difference]: Without dead ends: 92 [2024-10-11 18:07:39,091 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 18:07:39,098 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 1 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:39,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 125 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:07:39,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-11 18:07:39,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-11 18:07:39,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 41 states have (on average 2.2439024390243905) internal successors, (92), 88 states have internal predecessors, (92), 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 18:07:39,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2024-10-11 18:07:39,146 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 4 [2024-10-11 18:07:39,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:39,147 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2024-10-11 18:07:39,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:07:39,148 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2024-10-11 18:07:39,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 18:07:39,148 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:39,148 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 18:07:39,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 18:07:39,149 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-11 18:07:39,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:39,150 INFO L85 PathProgramCache]: Analyzing trace with hash 6012980, now seen corresponding path program 1 times [2024-10-11 18:07:39,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:39,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443416260] [2024-10-11 18:07:39,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:39,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:39,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:39,261 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 18:07:39,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:39,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443416260] [2024-10-11 18:07:39,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443416260] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:39,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:39,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:07:39,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424339997] [2024-10-11 18:07:39,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:39,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:07:39,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:39,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:07:39,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:07:39,268 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:07:39,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:39,371 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2024-10-11 18:07:39,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:07:39,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 18:07:39,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:39,373 INFO L225 Difference]: With dead ends: 90 [2024-10-11 18:07:39,373 INFO L226 Difference]: Without dead ends: 90 [2024-10-11 18:07:39,374 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 18:07:39,375 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 1 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:39,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 132 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:07:39,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-11 18:07:39,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-11 18:07:39,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 41 states have (on average 2.1951219512195124) internal successors, (90), 86 states have internal predecessors, (90), 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 18:07:39,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2024-10-11 18:07:39,385 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 4 [2024-10-11 18:07:39,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:39,386 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2024-10-11 18:07:39,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:07:39,387 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2024-10-11 18:07:39,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 18:07:39,388 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:39,388 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:39,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 18:07:39,388 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-11 18:07:39,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:39,389 INFO L85 PathProgramCache]: Analyzing trace with hash -276495055, now seen corresponding path program 1 times [2024-10-11 18:07:39,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:39,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436886925] [2024-10-11 18:07:39,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:39,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:39,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:39,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:39,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:39,660 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 18:07:39,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:39,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436886925] [2024-10-11 18:07:39,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436886925] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:39,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:39,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:07:39,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733798249] [2024-10-11 18:07:39,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:39,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:07:39,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:39,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:07:39,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:07:39,664 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 18:07:39,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:39,855 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2024-10-11 18:07:39,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:07:39,855 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 8 [2024-10-11 18:07:39,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:39,858 INFO L225 Difference]: With dead ends: 93 [2024-10-11 18:07:39,859 INFO L226 Difference]: Without dead ends: 93 [2024-10-11 18:07:39,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:07:39,863 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 12 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:39,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 144 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:07:39,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-11 18:07:39,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2024-10-11 18:07:39,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 41 states have (on average 2.1707317073170733) internal successors, (89), 85 states have internal predecessors, (89), 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 18:07:39,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2024-10-11 18:07:39,881 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 8 [2024-10-11 18:07:39,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:39,885 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2024-10-11 18:07:39,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 18:07:39,886 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2024-10-11 18:07:39,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 18:07:39,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:39,886 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:39,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 18:07:39,887 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-11 18:07:39,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:39,888 INFO L85 PathProgramCache]: Analyzing trace with hash -276495056, now seen corresponding path program 1 times [2024-10-11 18:07:39,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:39,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131754307] [2024-10-11 18:07:39,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:39,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:39,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:40,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:40,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:40,026 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 18:07:40,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:40,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131754307] [2024-10-11 18:07:40,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131754307] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:40,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:40,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:07:40,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474564969] [2024-10-11 18:07:40,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:40,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:07:40,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:40,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:07:40,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:07:40,033 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 18:07:40,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:40,190 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2024-10-11 18:07:40,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:07:40,191 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 8 [2024-10-11 18:07:40,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:40,192 INFO L225 Difference]: With dead ends: 92 [2024-10-11 18:07:40,192 INFO L226 Difference]: Without dead ends: 92 [2024-10-11 18:07:40,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:07:40,194 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 12 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:40,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 137 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:07:40,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-11 18:07:40,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2024-10-11 18:07:40,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 41 states have (on average 2.1463414634146343) internal successors, (88), 84 states have internal predecessors, (88), 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 18:07:40,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2024-10-11 18:07:40,211 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 8 [2024-10-11 18:07:40,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:40,211 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2024-10-11 18:07:40,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 18:07:40,212 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2024-10-11 18:07:40,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 18:07:40,212 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:40,212 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:40,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 18:07:40,213 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-11 18:07:40,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:40,214 INFO L85 PathProgramCache]: Analyzing trace with hash 18592277, now seen corresponding path program 1 times [2024-10-11 18:07:40,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:40,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817472722] [2024-10-11 18:07:40,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:40,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:40,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:40,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:40,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:40,337 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 18:07:40,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:40,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817472722] [2024-10-11 18:07:40,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817472722] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:40,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:40,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:07:40,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382988400] [2024-10-11 18:07:40,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:40,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:07:40,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:40,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:07:40,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:07:40,343 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 18:07:40,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:40,481 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2024-10-11 18:07:40,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:07:40,481 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), 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 9 [2024-10-11 18:07:40,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:40,482 INFO L225 Difference]: With dead ends: 91 [2024-10-11 18:07:40,482 INFO L226 Difference]: Without dead ends: 91 [2024-10-11 18:07:40,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:07:40,484 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 10 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:40,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 136 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:07:40,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-11 18:07:40,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2024-10-11 18:07:40,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 83 states have internal predecessors, (87), 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 18:07:40,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2024-10-11 18:07:40,490 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 9 [2024-10-11 18:07:40,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:40,490 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2024-10-11 18:07:40,491 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), 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 18:07:40,491 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2024-10-11 18:07:40,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 18:07:40,491 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:40,491 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:40,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 18:07:40,492 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-11 18:07:40,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:40,493 INFO L85 PathProgramCache]: Analyzing trace with hash 18592278, now seen corresponding path program 1 times [2024-10-11 18:07:40,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:40,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253043771] [2024-10-11 18:07:40,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:40,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:40,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:40,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:40,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:40,604 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 18:07:40,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:40,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253043771] [2024-10-11 18:07:40,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253043771] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:40,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:40,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:07:40,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549158070] [2024-10-11 18:07:40,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:40,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:07:40,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:40,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:07:40,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:07:40,609 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 18:07:40,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:40,723 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2024-10-11 18:07:40,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:07:40,724 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), 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 9 [2024-10-11 18:07:40,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:40,726 INFO L225 Difference]: With dead ends: 90 [2024-10-11 18:07:40,726 INFO L226 Difference]: Without dead ends: 90 [2024-10-11 18:07:40,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:07:40,727 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 10 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:40,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 143 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:07:40,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-11 18:07:40,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86. [2024-10-11 18:07:40,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 41 states have (on average 2.097560975609756) internal successors, (86), 82 states have internal predecessors, (86), 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 18:07:40,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2024-10-11 18:07:40,740 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 9 [2024-10-11 18:07:40,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:40,740 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2024-10-11 18:07:40,741 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), 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 18:07:40,741 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2024-10-11 18:07:40,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 18:07:40,741 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:40,741 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:40,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 18:07:40,741 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-11 18:07:40,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:40,742 INFO L85 PathProgramCache]: Analyzing trace with hash 576365043, now seen corresponding path program 1 times [2024-10-11 18:07:40,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:40,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998845670] [2024-10-11 18:07:40,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:40,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:40,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:40,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:40,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:41,045 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 18:07:41,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:41,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998845670] [2024-10-11 18:07:41,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998845670] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:41,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:41,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 18:07:41,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998724940] [2024-10-11 18:07:41,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:41,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 18:07:41,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:41,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 18:07:41,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:07:41,047 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand has 8 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 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 18:07:41,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:41,271 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2024-10-11 18:07:41,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:07:41,272 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 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 10 [2024-10-11 18:07:41,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:41,275 INFO L225 Difference]: With dead ends: 84 [2024-10-11 18:07:41,275 INFO L226 Difference]: Without dead ends: 84 [2024-10-11 18:07:41,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:07:41,276 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 17 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:41,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 239 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:07:41,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-11 18:07:41,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2024-10-11 18:07:41,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 41 states have (on average 1.951219512195122) internal successors, (80), 76 states have internal predecessors, (80), 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 18:07:41,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2024-10-11 18:07:41,287 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 10 [2024-10-11 18:07:41,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:41,287 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2024-10-11 18:07:41,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 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 18:07:41,289 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2024-10-11 18:07:41,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 18:07:41,289 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:41,290 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:41,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 18:07:41,290 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-11 18:07:41,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:41,291 INFO L85 PathProgramCache]: Analyzing trace with hash 576365044, now seen corresponding path program 1 times [2024-10-11 18:07:41,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:41,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197013106] [2024-10-11 18:07:41,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:41,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:41,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:41,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:41,681 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 18:07:41,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:41,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197013106] [2024-10-11 18:07:41,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197013106] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:41,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:41,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 18:07:41,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292313805] [2024-10-11 18:07:41,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:41,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:07:41,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:41,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:07:41,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:07:41,684 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 9 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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 18:07:41,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:41,905 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2024-10-11 18:07:41,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:07:41,906 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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 10 [2024-10-11 18:07:41,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:41,906 INFO L225 Difference]: With dead ends: 82 [2024-10-11 18:07:41,906 INFO L226 Difference]: Without dead ends: 82 [2024-10-11 18:07:41,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:07:41,907 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 11 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:41,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 240 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:07:41,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-11 18:07:41,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2024-10-11 18:07:41,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 41 states have (on average 1.9024390243902438) internal successors, (78), 74 states have internal predecessors, (78), 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 18:07:41,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2024-10-11 18:07:41,915 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 10 [2024-10-11 18:07:41,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:41,915 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2024-10-11 18:07:41,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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 18:07:41,920 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2024-10-11 18:07:41,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 18:07:41,920 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:41,920 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:41,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 18:07:41,922 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-11 18:07:41,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:41,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1883264764, now seen corresponding path program 1 times [2024-10-11 18:07:41,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:41,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499076918] [2024-10-11 18:07:41,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:41,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:41,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:42,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:42,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:42,068 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 18:07:42,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:42,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499076918] [2024-10-11 18:07:42,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499076918] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:42,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:42,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 18:07:42,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829488605] [2024-10-11 18:07:42,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:42,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:07:42,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:42,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:07:42,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:07:42,071 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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 18:07:42,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:42,238 INFO L93 Difference]: Finished difference Result 106 states and 118 transitions. [2024-10-11 18:07:42,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:07:42,239 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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 18:07:42,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:42,240 INFO L225 Difference]: With dead ends: 106 [2024-10-11 18:07:42,240 INFO L226 Difference]: Without dead ends: 106 [2024-10-11 18:07:42,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:07:42,241 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 58 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:42,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 191 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:07:42,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-11 18:07:42,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 93. [2024-10-11 18:07:42,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 56 states have (on average 1.9285714285714286) internal successors, (108), 88 states have internal predecessors, (108), 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 18:07:42,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 114 transitions. [2024-10-11 18:07:42,252 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 114 transitions. Word has length 16 [2024-10-11 18:07:42,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:42,254 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 114 transitions. [2024-10-11 18:07:42,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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 18:07:42,254 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 114 transitions. [2024-10-11 18:07:42,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 18:07:42,255 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:42,255 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:42,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 18:07:42,255 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-11 18:07:42,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:42,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1883264765, now seen corresponding path program 1 times [2024-10-11 18:07:42,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:42,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176860759] [2024-10-11 18:07:42,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:42,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:42,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:42,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:42,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:42,507 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 18:07:42,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:42,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176860759] [2024-10-11 18:07:42,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176860759] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:42,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:42,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 18:07:42,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773748289] [2024-10-11 18:07:42,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:42,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:07:42,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:42,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:07:42,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:07:42,510 INFO L87 Difference]: Start difference. First operand 93 states and 114 transitions. Second operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 7 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 18:07:42,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:42,741 INFO L93 Difference]: Finished difference Result 107 states and 123 transitions. [2024-10-11 18:07:42,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:07:42,742 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.0) internal successors, (14), 7 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 18:07:42,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:42,743 INFO L225 Difference]: With dead ends: 107 [2024-10-11 18:07:42,743 INFO L226 Difference]: Without dead ends: 107 [2024-10-11 18:07:42,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:07:42,744 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 24 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:42,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 363 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:07:42,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-11 18:07:42,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 98. [2024-10-11 18:07:42,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 61 states have (on average 1.901639344262295) internal successors, (116), 93 states have internal predecessors, (116), 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 18:07:42,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 122 transitions. [2024-10-11 18:07:42,749 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 122 transitions. Word has length 16 [2024-10-11 18:07:42,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:42,750 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 122 transitions. [2024-10-11 18:07:42,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.0) internal successors, (14), 7 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 18:07:42,750 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 122 transitions. [2024-10-11 18:07:42,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 18:07:42,751 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:42,751 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:42,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 18:07:42,751 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-11 18:07:42,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:42,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1636164687, now seen corresponding path program 1 times [2024-10-11 18:07:42,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:42,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111389472] [2024-10-11 18:07:42,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:42,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:42,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:42,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:42,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:42,943 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 18:07:42,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:42,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111389472] [2024-10-11 18:07:42,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111389472] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:42,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:42,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 18:07:42,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022923689] [2024-10-11 18:07:42,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:42,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 18:07:42,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:42,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 18:07:42,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:07:42,948 INFO L87 Difference]: Start difference. First operand 98 states and 122 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:43,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:43,107 INFO L93 Difference]: Finished difference Result 108 states and 135 transitions. [2024-10-11 18:07:43,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:07:43,108 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-10-11 18:07:43,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:43,109 INFO L225 Difference]: With dead ends: 108 [2024-10-11 18:07:43,109 INFO L226 Difference]: Without dead ends: 108 [2024-10-11 18:07:43,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:07:43,111 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 27 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:43,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 371 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:07:43,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-11 18:07:43,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 100. [2024-10-11 18:07:43,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 63 states have (on average 1.8571428571428572) internal successors, (117), 95 states have internal predecessors, (117), 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 18:07:43,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 123 transitions. [2024-10-11 18:07:43,123 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 123 transitions. Word has length 18 [2024-10-11 18:07:43,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:43,123 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 123 transitions. [2024-10-11 18:07:43,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:43,123 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 123 transitions. [2024-10-11 18:07:43,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 18:07:43,124 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:43,124 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:43,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 18:07:43,124 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-11 18:07:43,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:43,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1636210928, now seen corresponding path program 1 times [2024-10-11 18:07:43,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:43,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043818437] [2024-10-11 18:07:43,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:43,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:43,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:43,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:43,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:43,236 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 18:07:43,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:43,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043818437] [2024-10-11 18:07:43,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043818437] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:43,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:43,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:07:43,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573423408] [2024-10-11 18:07:43,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:43,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 18:07:43,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:43,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 18:07:43,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:07:43,238 INFO L87 Difference]: Start difference. First operand 100 states and 123 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:43,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:43,374 INFO L93 Difference]: Finished difference Result 107 states and 133 transitions. [2024-10-11 18:07:43,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:07:43,375 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-10-11 18:07:43,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:43,376 INFO L225 Difference]: With dead ends: 107 [2024-10-11 18:07:43,376 INFO L226 Difference]: Without dead ends: 107 [2024-10-11 18:07:43,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:07:43,377 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 3 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:43,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 156 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:07:43,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-11 18:07:43,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2024-10-11 18:07:43,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 69 states have (on average 1.8405797101449275) internal successors, (127), 101 states have internal predecessors, (127), 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 18:07:43,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 133 transitions. [2024-10-11 18:07:43,387 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 133 transitions. Word has length 18 [2024-10-11 18:07:43,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:43,387 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 133 transitions. [2024-10-11 18:07:43,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:43,387 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 133 transitions. [2024-10-11 18:07:43,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 18:07:43,388 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:43,388 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:43,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 18:07:43,388 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-11 18:07:43,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:43,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1636210929, now seen corresponding path program 1 times [2024-10-11 18:07:43,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:43,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697958156] [2024-10-11 18:07:43,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:43,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:43,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:43,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:43,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:43,634 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 18:07:43,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:43,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697958156] [2024-10-11 18:07:43,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697958156] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:43,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:43,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 18:07:43,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282381094] [2024-10-11 18:07:43,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:43,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:07:43,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:43,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:07:43,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:07:43,636 INFO L87 Difference]: Start difference. First operand 106 states and 133 transitions. Second operand has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:43,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:43,831 INFO L93 Difference]: Finished difference Result 106 states and 131 transitions. [2024-10-11 18:07:43,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:07:43,831 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-10-11 18:07:43,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:43,832 INFO L225 Difference]: With dead ends: 106 [2024-10-11 18:07:43,832 INFO L226 Difference]: Without dead ends: 106 [2024-10-11 18:07:43,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:07:43,833 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 22 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:43,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 378 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:07:43,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-11 18:07:43,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-10-11 18:07:43,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 69 states have (on average 1.8115942028985508) internal successors, (125), 101 states have internal predecessors, (125), 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 18:07:43,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 131 transitions. [2024-10-11 18:07:43,839 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 131 transitions. Word has length 18 [2024-10-11 18:07:43,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:43,840 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 131 transitions. [2024-10-11 18:07:43,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:43,840 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 131 transitions. [2024-10-11 18:07:43,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 18:07:43,842 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:43,842 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:43,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 18:07:43,842 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-11 18:07:43,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:43,843 INFO L85 PathProgramCache]: Analyzing trace with hash 536206589, now seen corresponding path program 1 times [2024-10-11 18:07:43,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:43,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702191741] [2024-10-11 18:07:43,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:43,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:43,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:43,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:43,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:43,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 18:07:43,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:44,020 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:07:44,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:44,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702191741] [2024-10-11 18:07:44,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702191741] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:44,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:44,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:07:44,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058428382] [2024-10-11 18:07:44,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:44,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 18:07:44,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:44,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 18:07:44,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:07:44,023 INFO L87 Difference]: Start difference. First operand 106 states and 131 transitions. Second operand has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:07:44,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:44,232 INFO L93 Difference]: Finished difference Result 106 states and 130 transitions. [2024-10-11 18:07:44,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:07:44,233 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2024-10-11 18:07:44,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:44,234 INFO L225 Difference]: With dead ends: 106 [2024-10-11 18:07:44,234 INFO L226 Difference]: Without dead ends: 106 [2024-10-11 18:07:44,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:07:44,235 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 14 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:44,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 170 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:07:44,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-11 18:07:44,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-10-11 18:07:44,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 69 states have (on average 1.7971014492753623) internal successors, (124), 101 states have internal predecessors, (124), 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 18:07:44,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 130 transitions. [2024-10-11 18:07:44,239 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 130 transitions. Word has length 19 [2024-10-11 18:07:44,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:44,239 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 130 transitions. [2024-10-11 18:07:44,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:07:44,240 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 130 transitions. [2024-10-11 18:07:44,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 18:07:44,240 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:44,241 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:44,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 18:07:44,241 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-11 18:07:44,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:44,241 INFO L85 PathProgramCache]: Analyzing trace with hash 536206590, now seen corresponding path program 1 times [2024-10-11 18:07:44,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:44,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337987029] [2024-10-11 18:07:44,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:44,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:44,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:44,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:44,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:44,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 18:07:44,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:44,643 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:07:44,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:44,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337987029] [2024-10-11 18:07:44,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337987029] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:07:44,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963641972] [2024-10-11 18:07:44,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:44,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:07:44,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:07:44,647 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 18:07:44,648 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 18:07:44,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:44,800 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 18:07:44,805 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:07:44,976 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2024-10-11 18:07:45,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:07:45,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-11 18:07:45,041 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:07:45,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:07:45,071 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:45,071 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:07:45,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963641972] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:45,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:07:45,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 16 [2024-10-11 18:07:45,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994114763] [2024-10-11 18:07:45,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:45,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:07:45,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:45,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:07:45,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=199, Unknown=1, NotChecked=28, Total=272 [2024-10-11 18:07:45,073 INFO L87 Difference]: Start difference. First operand 106 states and 130 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:07:45,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:45,286 INFO L93 Difference]: Finished difference Result 112 states and 125 transitions. [2024-10-11 18:07:45,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:07:45,286 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), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2024-10-11 18:07:45,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:45,287 INFO L225 Difference]: With dead ends: 112 [2024-10-11 18:07:45,287 INFO L226 Difference]: Without dead ends: 112 [2024-10-11 18:07:45,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=199, Unknown=1, NotChecked=28, Total=272 [2024-10-11 18:07:45,288 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 13 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 118 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:45,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 177 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 206 Invalid, 0 Unknown, 118 Unchecked, 0.2s Time] [2024-10-11 18:07:45,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-11 18:07:45,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 106. [2024-10-11 18:07:45,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 69 states have (on average 1.7246376811594204) internal successors, (119), 101 states have internal predecessors, (119), 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 18:07:45,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 125 transitions. [2024-10-11 18:07:45,292 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 125 transitions. Word has length 19 [2024-10-11 18:07:45,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:45,292 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 125 transitions. [2024-10-11 18:07:45,292 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), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:07:45,292 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 125 transitions. [2024-10-11 18:07:45,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 18:07:45,293 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:45,293 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:45,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 18:07:45,494 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,SelfDestructingSolverStorable14 [2024-10-11 18:07:45,495 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-11 18:07:45,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:45,496 INFO L85 PathProgramCache]: Analyzing trace with hash -101420063, now seen corresponding path program 1 times [2024-10-11 18:07:45,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:45,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350218497] [2024-10-11 18:07:45,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:45,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:45,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:45,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:45,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:45,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 18:07:45,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:45,908 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:07:45,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:45,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350218497] [2024-10-11 18:07:45,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350218497] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:45,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:45,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 18:07:45,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986877880] [2024-10-11 18:07:45,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:45,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 18:07:45,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:45,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 18:07:45,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:07:45,911 INFO L87 Difference]: Start difference. First operand 106 states and 125 transitions. Second operand has 8 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:07:46,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:46,130 INFO L93 Difference]: Finished difference Result 105 states and 123 transitions. [2024-10-11 18:07:46,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:07:46,131 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-10-11 18:07:46,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:46,133 INFO L225 Difference]: With dead ends: 105 [2024-10-11 18:07:46,133 INFO L226 Difference]: Without dead ends: 105 [2024-10-11 18:07:46,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:07:46,134 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 4 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:46,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 282 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:07:46,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-11 18:07:46,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-10-11 18:07:46,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 69 states have (on average 1.6956521739130435) internal successors, (117), 100 states have internal predecessors, (117), 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 18:07:46,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 123 transitions. [2024-10-11 18:07:46,138 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 123 transitions. Word has length 21 [2024-10-11 18:07:46,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:46,138 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 123 transitions. [2024-10-11 18:07:46,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:07:46,139 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 123 transitions. [2024-10-11 18:07:46,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 18:07:46,139 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:46,141 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:46,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 18:07:46,141 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-11 18:07:46,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:46,142 INFO L85 PathProgramCache]: Analyzing trace with hash -101420064, now seen corresponding path program 1 times [2024-10-11 18:07:46,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:46,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702453015] [2024-10-11 18:07:46,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:46,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:46,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:46,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:46,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:46,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 18:07:46,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:46,347 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 18:07:46,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:46,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702453015] [2024-10-11 18:07:46,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702453015] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:46,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:46,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 18:07:46,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136114573] [2024-10-11 18:07:46,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:46,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 18:07:46,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:46,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 18:07:46,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:07:46,350 INFO L87 Difference]: Start difference. First operand 105 states and 123 transitions. Second operand has 8 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:07:46,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:46,545 INFO L93 Difference]: Finished difference Result 104 states and 121 transitions. [2024-10-11 18:07:46,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:07:46,545 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-10-11 18:07:46,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:46,546 INFO L225 Difference]: With dead ends: 104 [2024-10-11 18:07:46,546 INFO L226 Difference]: Without dead ends: 104 [2024-10-11 18:07:46,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:07:46,547 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 6 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:46,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 256 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:07:46,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-11 18:07:46,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-10-11 18:07:46,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 69 states have (on average 1.6666666666666667) internal successors, (115), 99 states have internal predecessors, (115), 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 18:07:46,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 121 transitions. [2024-10-11 18:07:46,551 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 121 transitions. Word has length 21 [2024-10-11 18:07:46,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:46,551 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 121 transitions. [2024-10-11 18:07:46,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:07:46,552 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 121 transitions. [2024-10-11 18:07:46,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 18:07:46,552 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:46,552 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 18:07:46,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 18:07:46,553 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-11 18:07:46,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:46,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1649349557, now seen corresponding path program 1 times [2024-10-11 18:07:46,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:46,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198509862] [2024-10-11 18:07:46,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:46,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:46,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:46,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:46,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:46,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:07:46,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:46,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198509862] [2024-10-11 18:07:46,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198509862] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:46,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:46,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 18:07:46,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078711281] [2024-10-11 18:07:46,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:46,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 18:07:46,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:46,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 18:07:46,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:07:46,682 INFO L87 Difference]: Start difference. First operand 104 states and 121 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:46,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:46,913 INFO L93 Difference]: Finished difference Result 123 states and 143 transitions. [2024-10-11 18:07:46,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:07:46,914 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-10-11 18:07:46,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:46,915 INFO L225 Difference]: With dead ends: 123 [2024-10-11 18:07:46,915 INFO L226 Difference]: Without dead ends: 123 [2024-10-11 18:07:46,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:07:46,916 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 37 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:46,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 193 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:07:46,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-11 18:07:46,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 114. [2024-10-11 18:07:46,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 80 states have (on average 1.6875) internal successors, (135), 109 states have internal predecessors, (135), 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 18:07:46,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 141 transitions. [2024-10-11 18:07:46,924 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 141 transitions. Word has length 22 [2024-10-11 18:07:46,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:46,924 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 141 transitions. [2024-10-11 18:07:46,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:46,924 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 141 transitions. [2024-10-11 18:07:46,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 18:07:46,925 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:46,925 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 18:07:46,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 18:07:46,925 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-11 18:07:46,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:46,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1649349556, now seen corresponding path program 1 times [2024-10-11 18:07:46,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:46,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970549967] [2024-10-11 18:07:46,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:46,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:46,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:47,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:47,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:47,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:47,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:47,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970549967] [2024-10-11 18:07:47,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970549967] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:07:47,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421690783] [2024-10-11 18:07:47,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:47,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:07:47,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:07:47,198 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 18:07:47,200 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 18:07:47,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:47,345 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-11 18:07:47,347 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:07:47,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:47,533 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:07:47,723 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:07:47,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2024-10-11 18:07:47,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:47,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421690783] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 18:07:47,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:07:47,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 6] total 20 [2024-10-11 18:07:47,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433754878] [2024-10-11 18:07:47,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:47,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:07:47,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:47,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:07:47,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2024-10-11 18:07:47,822 INFO L87 Difference]: Start difference. First operand 114 states and 141 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:48,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:48,040 INFO L93 Difference]: Finished difference Result 128 states and 156 transitions. [2024-10-11 18:07:48,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:07:48,041 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-10-11 18:07:48,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:48,042 INFO L225 Difference]: With dead ends: 128 [2024-10-11 18:07:48,042 INFO L226 Difference]: Without dead ends: 128 [2024-10-11 18:07:48,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2024-10-11 18:07:48,044 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 38 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:48,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 167 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:07:48,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-11 18:07:48,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 117. [2024-10-11 18:07:48,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 83 states have (on average 1.6746987951807228) internal successors, (139), 112 states have internal predecessors, (139), 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 18:07:48,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 145 transitions. [2024-10-11 18:07:48,050 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 145 transitions. Word has length 22 [2024-10-11 18:07:48,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:48,051 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 145 transitions. [2024-10-11 18:07:48,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:48,051 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 145 transitions. [2024-10-11 18:07:48,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 18:07:48,052 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:48,052 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:48,073 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 18:07:48,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:07:48,253 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-11 18:07:48,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:48,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1649303316, now seen corresponding path program 1 times [2024-10-11 18:07:48,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:48,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227038504] [2024-10-11 18:07:48,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:48,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:48,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:49,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:49,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:49,244 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:49,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:49,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227038504] [2024-10-11 18:07:49,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227038504] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:07:49,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120159503] [2024-10-11 18:07:49,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:49,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:07:49,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:07:49,247 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 18:07:49,249 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 18:07:49,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:49,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-10-11 18:07:49,402 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:07:49,409 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 18:07:49,443 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 18:07:49,449 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 18:07:49,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-10-11 18:07:49,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-10-11 18:07:49,612 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-11 18:07:49,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-11 18:07:49,708 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-11 18:07:49,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-11 18:07:49,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-10-11 18:07:49,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-10-11 18:07:49,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-10-11 18:07:49,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-10-11 18:07:49,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:07:49,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:07:49,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-11 18:07:49,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:07:49,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:07:49,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-11 18:07:50,002 INFO L349 Elim1Store]: treesize reduction 40, result has 40.3 percent of original size [2024-10-11 18:07:50,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 33 [2024-10-11 18:07:50,040 INFO L349 Elim1Store]: treesize reduction 40, result has 40.3 percent of original size [2024-10-11 18:07:50,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 33 [2024-10-11 18:07:50,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-11 18:07:50,380 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:50,380 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:07:51,789 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:07:51,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 36 [2024-10-11 18:07:51,800 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:07:51,807 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:07:51,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 150 treesize of output 134 [2024-10-11 18:07:51,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2024-10-11 18:07:51,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2024-10-11 18:07:51,979 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:07:51,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 36 [2024-10-11 18:07:51,989 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:07:52,000 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:07:52,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 70 [2024-10-11 18:07:52,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2024-10-11 18:07:52,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2024-10-11 18:07:52,372 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:52,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120159503] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:07:52,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:07:52,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 14] total 33 [2024-10-11 18:07:52,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772200415] [2024-10-11 18:07:52,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:07:52,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-11 18:07:52,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:52,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-11 18:07:52,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=946, Unknown=4, NotChecked=0, Total=1056 [2024-10-11 18:07:52,375 INFO L87 Difference]: Start difference. First operand 117 states and 145 transitions. Second operand has 33 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 29 states have internal predecessors, (50), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:07:53,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:53,539 INFO L93 Difference]: Finished difference Result 114 states and 139 transitions. [2024-10-11 18:07:53,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 18:07:53,540 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 29 states have internal predecessors, (50), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2024-10-11 18:07:53,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:53,540 INFO L225 Difference]: With dead ends: 114 [2024-10-11 18:07:53,540 INFO L226 Difference]: Without dead ends: 114 [2024-10-11 18:07:53,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=151, Invalid=1251, Unknown=4, NotChecked=0, Total=1406 [2024-10-11 18:07:53,542 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 21 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:53,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 798 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 18:07:53,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-11 18:07:53,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-10-11 18:07:53,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 80 states have (on average 1.6625) internal successors, (133), 109 states have internal predecessors, (133), 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 18:07:53,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 139 transitions. [2024-10-11 18:07:53,546 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 139 transitions. Word has length 22 [2024-10-11 18:07:53,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:53,547 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 139 transitions. [2024-10-11 18:07:53,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 29 states have internal predecessors, (50), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:07:53,547 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 139 transitions. [2024-10-11 18:07:53,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 18:07:53,548 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:53,548 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] [2024-10-11 18:07:53,568 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 18:07:53,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:07:53,753 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-11 18:07:53,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:53,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1319685150, now seen corresponding path program 1 times [2024-10-11 18:07:53,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:53,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756440630] [2024-10-11 18:07:53,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:53,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:53,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:54,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:54,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:54,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 18:07:54,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:54,092 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:07:54,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:54,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756440630] [2024-10-11 18:07:54,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756440630] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:54,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:54,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 18:07:54,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210541542] [2024-10-11 18:07:54,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:54,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 18:07:54,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:54,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 18:07:54,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-11 18:07:54,095 INFO L87 Difference]: Start difference. First operand 114 states and 139 transitions. Second operand has 12 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:07:54,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:54,364 INFO L93 Difference]: Finished difference Result 115 states and 138 transitions. [2024-10-11 18:07:54,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 18:07:54,365 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2024-10-11 18:07:54,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:54,365 INFO L225 Difference]: With dead ends: 115 [2024-10-11 18:07:54,366 INFO L226 Difference]: Without dead ends: 115 [2024-10-11 18:07:54,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-10-11 18:07:54,366 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 21 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:54,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 310 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:07:54,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-11 18:07:54,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2024-10-11 18:07:54,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 80 states have (on average 1.65) internal successors, (132), 109 states have internal predecessors, (132), 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 18:07:54,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 138 transitions. [2024-10-11 18:07:54,373 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 138 transitions. Word has length 23 [2024-10-11 18:07:54,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:54,374 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 138 transitions. [2024-10-11 18:07:54,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:07:54,374 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 138 transitions. [2024-10-11 18:07:54,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 18:07:54,375 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:54,375 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] [2024-10-11 18:07:54,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 18:07:54,376 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-11 18:07:54,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:54,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1319685151, now seen corresponding path program 1 times [2024-10-11 18:07:54,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:54,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676912074] [2024-10-11 18:07:54,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:54,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:54,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:54,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:54,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:54,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 18:07:54,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:54,814 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:07:54,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:54,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676912074] [2024-10-11 18:07:54,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676912074] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:54,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:54,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 18:07:54,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528370414] [2024-10-11 18:07:54,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:54,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 18:07:54,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:54,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 18:07:54,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 18:07:54,817 INFO L87 Difference]: Start difference. First operand 114 states and 138 transitions. Second operand has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:07:55,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:55,091 INFO L93 Difference]: Finished difference Result 114 states and 137 transitions. [2024-10-11 18:07:55,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 18:07:55,092 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2024-10-11 18:07:55,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:55,092 INFO L225 Difference]: With dead ends: 114 [2024-10-11 18:07:55,093 INFO L226 Difference]: Without dead ends: 114 [2024-10-11 18:07:55,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-10-11 18:07:55,094 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 18 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:55,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 285 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:07:55,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-11 18:07:55,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-10-11 18:07:55,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 80 states have (on average 1.6375) internal successors, (131), 109 states have internal predecessors, (131), 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 18:07:55,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 137 transitions. [2024-10-11 18:07:55,097 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 137 transitions. Word has length 23 [2024-10-11 18:07:55,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:55,098 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 137 transitions. [2024-10-11 18:07:55,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:07:55,098 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 137 transitions. [2024-10-11 18:07:55,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 18:07:55,099 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:55,099 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 18:07:55,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 18:07:55,099 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-11 18:07:55,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:55,100 INFO L85 PathProgramCache]: Analyzing trace with hash 409771360, now seen corresponding path program 1 times [2024-10-11 18:07:55,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:55,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523119816] [2024-10-11 18:07:55,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:55,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:55,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:55,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:55,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:55,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:07:55,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:55,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523119816] [2024-10-11 18:07:55,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523119816] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:55,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:55,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 18:07:55,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28121788] [2024-10-11 18:07:55,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:55,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:07:55,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:55,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:07:55,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:07:55,291 INFO L87 Difference]: Start difference. First operand 114 states and 137 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:55,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:55,505 INFO L93 Difference]: Finished difference Result 133 states and 162 transitions. [2024-10-11 18:07:55,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:07:55,505 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-10-11 18:07:55,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:55,506 INFO L225 Difference]: With dead ends: 133 [2024-10-11 18:07:55,506 INFO L226 Difference]: Without dead ends: 133 [2024-10-11 18:07:55,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-11 18:07:55,507 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 34 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:55,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 263 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:07:55,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-11 18:07:55,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 115. [2024-10-11 18:07:55,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 81 states have (on average 1.6296296296296295) internal successors, (132), 110 states have internal predecessors, (132), 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 18:07:55,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 138 transitions. [2024-10-11 18:07:55,511 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 138 transitions. Word has length 23 [2024-10-11 18:07:55,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:55,511 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 138 transitions. [2024-10-11 18:07:55,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:55,511 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 138 transitions. [2024-10-11 18:07:55,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 18:07:55,512 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:55,512 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 18:07:55,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 18:07:55,512 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-11 18:07:55,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:55,512 INFO L85 PathProgramCache]: Analyzing trace with hash 409791476, now seen corresponding path program 1 times [2024-10-11 18:07:55,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:55,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630932481] [2024-10-11 18:07:55,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:55,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:55,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:55,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:55,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:55,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:07:55,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:55,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630932481] [2024-10-11 18:07:55,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630932481] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:55,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:55,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 18:07:55,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670331347] [2024-10-11 18:07:55,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:55,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:07:55,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:55,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:07:55,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:07:55,636 INFO L87 Difference]: Start difference. First operand 115 states and 138 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 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 18:07:55,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:55,803 INFO L93 Difference]: Finished difference Result 119 states and 140 transitions. [2024-10-11 18:07:55,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:07:55,804 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 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 18:07:55,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:55,804 INFO L225 Difference]: With dead ends: 119 [2024-10-11 18:07:55,805 INFO L226 Difference]: Without dead ends: 119 [2024-10-11 18:07:55,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:07:55,805 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 44 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:55,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 306 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:07:55,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-11 18:07:55,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 114. [2024-10-11 18:07:55,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 80 states have (on average 1.575) internal successors, (126), 109 states have internal predecessors, (126), 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 18:07:55,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 132 transitions. [2024-10-11 18:07:55,809 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 132 transitions. Word has length 23 [2024-10-11 18:07:55,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:55,810 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 132 transitions. [2024-10-11 18:07:55,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 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 18:07:55,810 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 132 transitions. [2024-10-11 18:07:55,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 18:07:55,810 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:55,810 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:55,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 18:07:55,811 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-11 18:07:55,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:55,811 INFO L85 PathProgramCache]: Analyzing trace with hash -181989589, now seen corresponding path program 1 times [2024-10-11 18:07:55,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:55,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059627270] [2024-10-11 18:07:55,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:55,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:55,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:56,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:56,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:56,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:07:56,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:56,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059627270] [2024-10-11 18:07:56,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059627270] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:56,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:56,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 18:07:56,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451290002] [2024-10-11 18:07:56,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:56,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:07:56,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:56,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:07:56,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:07:56,049 INFO L87 Difference]: Start difference. First operand 114 states and 132 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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 18:07:56,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:56,293 INFO L93 Difference]: Finished difference Result 129 states and 150 transitions. [2024-10-11 18:07:56,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:07:56,294 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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 24 [2024-10-11 18:07:56,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:56,295 INFO L225 Difference]: With dead ends: 129 [2024-10-11 18:07:56,295 INFO L226 Difference]: Without dead ends: 129 [2024-10-11 18:07:56,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-11 18:07:56,296 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 33 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:56,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 218 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:07:56,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-10-11 18:07:56,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 115. [2024-10-11 18:07:56,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 81 states have (on average 1.5679012345679013) internal successors, (127), 110 states have internal predecessors, (127), 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 18:07:56,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 133 transitions. [2024-10-11 18:07:56,300 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 133 transitions. Word has length 24 [2024-10-11 18:07:56,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:56,301 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 133 transitions. [2024-10-11 18:07:56,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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 18:07:56,301 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 133 transitions. [2024-10-11 18:07:56,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 18:07:56,301 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:56,301 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] [2024-10-11 18:07:56,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 18:07:56,302 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-11 18:07:56,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:56,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1202176680, now seen corresponding path program 1 times [2024-10-11 18:07:56,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:56,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549497501] [2024-10-11 18:07:56,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:56,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:56,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:56,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:56,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:56,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 18:07:56,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:56,690 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:07:56,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:56,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549497501] [2024-10-11 18:07:56,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549497501] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:56,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:56,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 18:07:56,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702119487] [2024-10-11 18:07:56,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:56,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 18:07:56,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:56,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 18:07:56,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-10-11 18:07:56,692 INFO L87 Difference]: Start difference. First operand 115 states and 133 transitions. Second operand has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:07:56,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:56,993 INFO L93 Difference]: Finished difference Result 116 states and 132 transitions. [2024-10-11 18:07:56,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 18:07:56,994 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2024-10-11 18:07:56,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:56,995 INFO L225 Difference]: With dead ends: 116 [2024-10-11 18:07:56,995 INFO L226 Difference]: Without dead ends: 116 [2024-10-11 18:07:56,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2024-10-11 18:07:56,996 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 23 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:56,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 271 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:07:56,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-11 18:07:57,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2024-10-11 18:07:57,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 81 states have (on average 1.5555555555555556) internal successors, (126), 110 states have internal predecessors, (126), 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 18:07:57,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 132 transitions. [2024-10-11 18:07:57,008 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 132 transitions. Word has length 25 [2024-10-11 18:07:57,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:57,008 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 132 transitions. [2024-10-11 18:07:57,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:07:57,008 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 132 transitions. [2024-10-11 18:07:57,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 18:07:57,009 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:57,009 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] [2024-10-11 18:07:57,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 18:07:57,009 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-11 18:07:57,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:57,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1202176681, now seen corresponding path program 1 times [2024-10-11 18:07:57,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:57,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607258719] [2024-10-11 18:07:57,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:57,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:57,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:57,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:57,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:57,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 18:07:57,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:57,577 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:07:57,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:57,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607258719] [2024-10-11 18:07:57,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607258719] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:57,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:57,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 18:07:57,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980172084] [2024-10-11 18:07:57,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:57,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 18:07:57,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:57,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 18:07:57,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-11 18:07:57,579 INFO L87 Difference]: Start difference. First operand 115 states and 132 transitions. Second operand has 12 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:07:57,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:57,867 INFO L93 Difference]: Finished difference Result 115 states and 131 transitions. [2024-10-11 18:07:57,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 18:07:57,868 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2024-10-11 18:07:57,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:57,869 INFO L225 Difference]: With dead ends: 115 [2024-10-11 18:07:57,869 INFO L226 Difference]: Without dead ends: 115 [2024-10-11 18:07:57,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-10-11 18:07:57,870 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 20 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:57,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 312 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:07:57,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-11 18:07:57,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-10-11 18:07:57,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 81 states have (on average 1.5432098765432098) internal successors, (125), 110 states have internal predecessors, (125), 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 18:07:57,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 131 transitions. [2024-10-11 18:07:57,875 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 131 transitions. Word has length 25 [2024-10-11 18:07:57,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:57,876 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 131 transitions. [2024-10-11 18:07:57,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:07:57,876 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 131 transitions. [2024-10-11 18:07:57,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 18:07:57,876 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:57,876 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:57,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 18:07:57,877 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-11 18:07:57,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:57,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1346709822, now seen corresponding path program 1 times [2024-10-11 18:07:57,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:57,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960024951] [2024-10-11 18:07:57,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:57,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:57,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:58,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:58,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:58,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:07:58,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:58,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960024951] [2024-10-11 18:07:58,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960024951] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:58,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:58,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 18:07:58,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758969942] [2024-10-11 18:07:58,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:58,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 18:07:58,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:58,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 18:07:58,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:07:58,203 INFO L87 Difference]: Start difference. First operand 115 states and 131 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:58,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:58,431 INFO L93 Difference]: Finished difference Result 116 states and 132 transitions. [2024-10-11 18:07:58,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:07:58,432 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-10-11 18:07:58,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:58,433 INFO L225 Difference]: With dead ends: 116 [2024-10-11 18:07:58,433 INFO L226 Difference]: Without dead ends: 116 [2024-10-11 18:07:58,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-11 18:07:58,433 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 12 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:58,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 262 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:07:58,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-11 18:07:58,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-10-11 18:07:58,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 82 states have (on average 1.5365853658536586) internal successors, (126), 111 states have internal predecessors, (126), 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 18:07:58,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 132 transitions. [2024-10-11 18:07:58,437 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 132 transitions. Word has length 25 [2024-10-11 18:07:58,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:58,437 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 132 transitions. [2024-10-11 18:07:58,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:58,437 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 132 transitions. [2024-10-11 18:07:58,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 18:07:58,437 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:58,438 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:58,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-11 18:07:58,438 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-11 18:07:58,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:58,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1201668622, now seen corresponding path program 1 times [2024-10-11 18:07:58,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:58,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28984851] [2024-10-11 18:07:58,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:58,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:58,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:58,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:58,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:58,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:07:58,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:58,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28984851] [2024-10-11 18:07:58,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28984851] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:58,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:07:58,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 18:07:58,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920551485] [2024-10-11 18:07:58,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:58,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 18:07:58,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:58,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 18:07:58,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-10-11 18:07:58,746 INFO L87 Difference]: Start difference. First operand 116 states and 132 transitions. Second operand has 13 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:59,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:59,077 INFO L93 Difference]: Finished difference Result 123 states and 140 transitions. [2024-10-11 18:07:59,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 18:07:59,078 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-10-11 18:07:59,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:59,078 INFO L225 Difference]: With dead ends: 123 [2024-10-11 18:07:59,079 INFO L226 Difference]: Without dead ends: 123 [2024-10-11 18:07:59,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-10-11 18:07:59,079 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 38 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:59,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 309 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:07:59,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-11 18:07:59,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 117. [2024-10-11 18:07:59,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 83 states have (on average 1.5421686746987953) internal successors, (128), 112 states have internal predecessors, (128), 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 18:07:59,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 134 transitions. [2024-10-11 18:07:59,087 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 134 transitions. Word has length 26 [2024-10-11 18:07:59,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:59,087 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 134 transitions. [2024-10-11 18:07:59,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:59,087 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 134 transitions. [2024-10-11 18:07:59,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 18:07:59,087 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:59,087 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:07:59,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-11 18:07:59,088 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-11 18:07:59,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:07:59,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1201668623, now seen corresponding path program 1 times [2024-10-11 18:07:59,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:07:59,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955063004] [2024-10-11 18:07:59,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:59,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:07:59,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:59,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:07:59,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:59,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:07:59,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:07:59,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955063004] [2024-10-11 18:07:59,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955063004] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:07:59,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888354499] [2024-10-11 18:07:59,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:07:59,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:07:59,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:07:59,329 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 18:07:59,331 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 18:07:59,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:07:59,516 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 18:07:59,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:07:59,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:07:59,648 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:07:59,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888354499] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:07:59,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:07:59,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 15 [2024-10-11 18:07:59,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880212361] [2024-10-11 18:07:59,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:07:59,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:07:59,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:07:59,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:07:59,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2024-10-11 18:07:59,652 INFO L87 Difference]: Start difference. First operand 117 states and 134 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:59,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:07:59,806 INFO L93 Difference]: Finished difference Result 128 states and 149 transitions. [2024-10-11 18:07:59,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:07:59,806 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-10-11 18:07:59,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:07:59,807 INFO L225 Difference]: With dead ends: 128 [2024-10-11 18:07:59,807 INFO L226 Difference]: Without dead ends: 128 [2024-10-11 18:07:59,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2024-10-11 18:07:59,808 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 38 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:07:59,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 184 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:07:59,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-11 18:07:59,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 122. [2024-10-11 18:07:59,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 88 states have (on average 1.5454545454545454) internal successors, (136), 117 states have internal predecessors, (136), 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 18:07:59,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 142 transitions. [2024-10-11 18:07:59,816 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 142 transitions. Word has length 26 [2024-10-11 18:07:59,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:07:59,816 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 142 transitions. [2024-10-11 18:07:59,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:07:59,816 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 142 transitions. [2024-10-11 18:07:59,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 18:07:59,817 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:07:59,817 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 18:07:59,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 18:08:00,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:08:00,018 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-11 18:08:00,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:08:00,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1402978298, now seen corresponding path program 1 times [2024-10-11 18:08:00,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:08:00,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815899377] [2024-10-11 18:08:00,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:08:00,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:08:00,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:00,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:08:00,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:00,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:08:00,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:08:00,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815899377] [2024-10-11 18:08:00,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815899377] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:08:00,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:08:00,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 18:08:00,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312641020] [2024-10-11 18:08:00,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:08:00,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 18:08:00,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:08:00,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 18:08:00,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-10-11 18:08:00,364 INFO L87 Difference]: Start difference. First operand 122 states and 142 transitions. Second operand has 12 states, 10 states have (on average 2.5) internal successors, (25), 10 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 18:08:00,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:08:00,613 INFO L93 Difference]: Finished difference Result 125 states and 142 transitions. [2024-10-11 18:08:00,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 18:08:00,614 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.5) internal successors, (25), 10 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 18:08:00,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:08:00,615 INFO L225 Difference]: With dead ends: 125 [2024-10-11 18:08:00,616 INFO L226 Difference]: Without dead ends: 125 [2024-10-11 18:08:00,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-10-11 18:08:00,616 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 20 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:08:00,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 459 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:08:00,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-10-11 18:08:00,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2024-10-11 18:08:00,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 89 states have (on average 1.5280898876404494) internal successors, (136), 118 states have internal predecessors, (136), 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 18:08:00,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 142 transitions. [2024-10-11 18:08:00,620 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 142 transitions. Word has length 27 [2024-10-11 18:08:00,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:08:00,621 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 142 transitions. [2024-10-11 18:08:00,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.5) internal successors, (25), 10 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 18:08:00,621 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 142 transitions. [2024-10-11 18:08:00,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 18:08:00,622 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:08:00,622 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:08:00,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-11 18:08:00,622 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-11 18:08:00,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:08:00,623 INFO L85 PathProgramCache]: Analyzing trace with hash -542654130, now seen corresponding path program 1 times [2024-10-11 18:08:00,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:08:00,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816407090] [2024-10-11 18:08:00,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:08:00,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:08:00,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:00,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:08:00,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:00,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:08:00,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:08:00,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816407090] [2024-10-11 18:08:00,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816407090] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:08:00,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:08:00,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 18:08:00,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488291622] [2024-10-11 18:08:00,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:08:00,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 18:08:00,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:08:00,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 18:08:00,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-10-11 18:08:00,958 INFO L87 Difference]: Start difference. First operand 123 states and 142 transitions. Second operand has 12 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:08:01,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:08:01,254 INFO L93 Difference]: Finished difference Result 124 states and 141 transitions. [2024-10-11 18:08:01,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 18:08:01,256 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2024-10-11 18:08:01,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:08:01,257 INFO L225 Difference]: With dead ends: 124 [2024-10-11 18:08:01,257 INFO L226 Difference]: Without dead ends: 124 [2024-10-11 18:08:01,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-10-11 18:08:01,257 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 31 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:08:01,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 373 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:08:01,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-11 18:08:01,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2024-10-11 18:08:01,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 89 states have (on average 1.5168539325842696) internal successors, (135), 118 states have internal predecessors, (135), 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 18:08:01,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 141 transitions. [2024-10-11 18:08:01,265 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 141 transitions. Word has length 28 [2024-10-11 18:08:01,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:08:01,265 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 141 transitions. [2024-10-11 18:08:01,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:08:01,266 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 141 transitions. [2024-10-11 18:08:01,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 18:08:01,266 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:08:01,266 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 18:08:01,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-11 18:08:01,266 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-11 18:08:01,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:08:01,267 INFO L85 PathProgramCache]: Analyzing trace with hash 357591304, now seen corresponding path program 1 times [2024-10-11 18:08:01,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:08:01,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149003104] [2024-10-11 18:08:01,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:08:01,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:08:01,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:01,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:08:01,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:01,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:08:01,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:08:01,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149003104] [2024-10-11 18:08:01,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149003104] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:08:01,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:08:01,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-11 18:08:01,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596628959] [2024-10-11 18:08:01,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:08:01,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 18:08:01,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:08:01,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 18:08:01,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2024-10-11 18:08:01,864 INFO L87 Difference]: Start difference. First operand 123 states and 141 transitions. Second operand has 16 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 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 18:08:02,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:08:02,294 INFO L93 Difference]: Finished difference Result 123 states and 140 transitions. [2024-10-11 18:08:02,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 18:08:02,294 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 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 18:08:02,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:08:02,295 INFO L225 Difference]: With dead ends: 123 [2024-10-11 18:08:02,295 INFO L226 Difference]: Without dead ends: 123 [2024-10-11 18:08:02,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2024-10-11 18:08:02,296 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 29 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:08:02,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 478 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 18:08:02,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-11 18:08:02,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-10-11 18:08:02,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 89 states have (on average 1.5056179775280898) internal successors, (134), 118 states have internal predecessors, (134), 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 18:08:02,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 140 transitions. [2024-10-11 18:08:02,299 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 140 transitions. Word has length 29 [2024-10-11 18:08:02,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:08:02,299 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 140 transitions. [2024-10-11 18:08:02,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 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 18:08:02,300 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 140 transitions. [2024-10-11 18:08:02,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 18:08:02,300 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:08:02,300 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] [2024-10-11 18:08:02,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-11 18:08:02,300 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-11 18:08:02,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:08:02,300 INFO L85 PathProgramCache]: Analyzing trace with hash 857299597, now seen corresponding path program 1 times [2024-10-11 18:08:02,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:08:02,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433958943] [2024-10-11 18:08:02,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:08:02,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:08:02,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:02,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:08:02,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:02,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 18:08:02,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:02,562 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:08:02,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:08:02,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433958943] [2024-10-11 18:08:02,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433958943] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:08:02,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865562611] [2024-10-11 18:08:02,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:08:02,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:08:02,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:08:02,565 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 18:08:02,566 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 18:08:02,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:02,784 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-11 18:08:02,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:08:02,913 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 18:08:02,913 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:08:03,002 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:08:03,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2024-10-11 18:08:03,109 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 18:08:03,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865562611] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:08:03,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:08:03,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 17 [2024-10-11 18:08:03,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606265578] [2024-10-11 18:08:03,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:08:03,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 18:08:03,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:08:03,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 18:08:03,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2024-10-11 18:08:03,112 INFO L87 Difference]: Start difference. First operand 123 states and 140 transitions. Second operand has 18 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-11 18:08:03,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:08:03,326 INFO L93 Difference]: Finished difference Result 126 states and 139 transitions. [2024-10-11 18:08:03,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 18:08:03,327 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 31 [2024-10-11 18:08:03,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:08:03,327 INFO L225 Difference]: With dead ends: 126 [2024-10-11 18:08:03,328 INFO L226 Difference]: Without dead ends: 126 [2024-10-11 18:08:03,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2024-10-11 18:08:03,328 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 38 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:08:03,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 449 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:08:03,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-10-11 18:08:03,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 123. [2024-10-11 18:08:03,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 89 states have (on average 1.4719101123595506) internal successors, (131), 118 states have internal predecessors, (131), 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 18:08:03,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 137 transitions. [2024-10-11 18:08:03,332 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 137 transitions. Word has length 31 [2024-10-11 18:08:03,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:08:03,332 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 137 transitions. [2024-10-11 18:08:03,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-11 18:08:03,332 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 137 transitions. [2024-10-11 18:08:03,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 18:08:03,333 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:08:03,333 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:08:03,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 18:08:03,533 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,SelfDestructingSolverStorable33 [2024-10-11 18:08:03,533 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-11 18:08:03,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:08:03,534 INFO L85 PathProgramCache]: Analyzing trace with hash 47864619, now seen corresponding path program 1 times [2024-10-11 18:08:03,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:08:03,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505006499] [2024-10-11 18:08:03,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:08:03,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:08:03,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:03,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:08:03,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:04,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:08:04,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:08:04,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505006499] [2024-10-11 18:08:04,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505006499] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:08:04,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:08:04,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-11 18:08:04,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543847706] [2024-10-11 18:08:04,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:08:04,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 18:08:04,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:08:04,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 18:08:04,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-10-11 18:08:04,038 INFO L87 Difference]: Start difference. First operand 123 states and 137 transitions. Second operand has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 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 18:08:04,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:08:04,341 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2024-10-11 18:08:04,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 18:08:04,342 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 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 31 [2024-10-11 18:08:04,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:08:04,343 INFO L225 Difference]: With dead ends: 123 [2024-10-11 18:08:04,343 INFO L226 Difference]: Without dead ends: 123 [2024-10-11 18:08:04,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2024-10-11 18:08:04,343 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 40 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:08:04,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 374 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:08:04,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-11 18:08:04,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-10-11 18:08:04,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 89 states have (on average 1.4606741573033708) internal successors, (130), 118 states have internal predecessors, (130), 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 18:08:04,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 136 transitions. [2024-10-11 18:08:04,347 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 136 transitions. Word has length 31 [2024-10-11 18:08:04,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:08:04,347 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 136 transitions. [2024-10-11 18:08:04,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 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 18:08:04,347 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 136 transitions. [2024-10-11 18:08:04,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-11 18:08:04,348 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:08:04,348 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:08:04,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-11 18:08:04,349 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-11 18:08:04,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:08:04,349 INFO L85 PathProgramCache]: Analyzing trace with hash 806483757, now seen corresponding path program 1 times [2024-10-11 18:08:04,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:08:04,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492849370] [2024-10-11 18:08:04,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:08:04,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:08:04,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:04,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:08:04,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:04,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 18:08:04,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:05,064 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:08:05,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:08:05,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492849370] [2024-10-11 18:08:05,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492849370] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:08:05,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904315519] [2024-10-11 18:08:05,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:08:05,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:08:05,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:08:05,067 INFO L229 MonitoredProcess]: Starting monitored process 7 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 18:08:05,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 18:08:05,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:05,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-11 18:08:05,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:08:05,488 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:08:05,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:08:05,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-11 18:08:05,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 18:08:05,609 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 18:08:05,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-10-11 18:08:05,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2024-10-11 18:08:05,681 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 18:08:05,681 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:08:05,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904315519] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:08:05,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:08:05,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 26 [2024-10-11 18:08:05,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395306871] [2024-10-11 18:08:05,846 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:08:05,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-11 18:08:05,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:08:05,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-11 18:08:05,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=818, Unknown=0, NotChecked=0, Total=930 [2024-10-11 18:08:05,848 INFO L87 Difference]: Start difference. First operand 123 states and 136 transitions. Second operand has 27 states, 23 states have (on average 2.347826086956522) internal successors, (54), 23 states have internal predecessors, (54), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:08:06,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:08:06,282 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2024-10-11 18:08:06,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 18:08:06,282 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 2.347826086956522) internal successors, (54), 23 states have internal predecessors, (54), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 32 [2024-10-11 18:08:06,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:08:06,283 INFO L225 Difference]: With dead ends: 121 [2024-10-11 18:08:06,283 INFO L226 Difference]: Without dead ends: 121 [2024-10-11 18:08:06,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=181, Invalid=1151, Unknown=0, NotChecked=0, Total=1332 [2024-10-11 18:08:06,284 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 85 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:08:06,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 530 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:08:06,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-11 18:08:06,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-10-11 18:08:06,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 89 states have (on average 1.404494382022472) internal successors, (125), 116 states have internal predecessors, (125), 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 18:08:06,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 131 transitions. [2024-10-11 18:08:06,287 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 131 transitions. Word has length 32 [2024-10-11 18:08:06,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:08:06,287 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 131 transitions. [2024-10-11 18:08:06,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 2.347826086956522) internal successors, (54), 23 states have internal predecessors, (54), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:08:06,288 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 131 transitions. [2024-10-11 18:08:06,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 18:08:06,288 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:08:06,288 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:08:06,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 18:08:06,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-10-11 18:08:06,489 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-11 18:08:06,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:08:06,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1004834963, now seen corresponding path program 1 times [2024-10-11 18:08:06,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:08:06,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914880783] [2024-10-11 18:08:06,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:08:06,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:08:06,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:06,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:08:06,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:06,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 18:08:06,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:06,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 18:08:06,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:07,058 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 18:08:07,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:08:07,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914880783] [2024-10-11 18:08:07,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914880783] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:08:07,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670755100] [2024-10-11 18:08:07,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:08:07,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:08:07,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:08:07,062 INFO L229 MonitoredProcess]: Starting monitored process 8 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 18:08:07,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 18:08:07,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:07,291 INFO L255 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-11 18:08:07,295 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:08:07,337 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:08:07,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:08:07,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 18:08:07,373 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 18:08:07,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-10-11 18:08:07,414 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 18:08:07,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-10-11 18:08:07,457 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 18:08:07,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-10-11 18:08:07,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-10-11 18:08:07,480 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base (select |c_#valid| alloc_and_zero_~pi~0.base))))) is different from true [2024-10-11 18:08:07,504 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-11 18:08:07,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-11 18:08:07,508 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 3 not checked. [2024-10-11 18:08:07,508 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:08:07,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670755100] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:08:07,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:08:07,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 19 [2024-10-11 18:08:07,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677053143] [2024-10-11 18:08:07,558 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:08:07,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 18:08:07,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:08:07,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 18:08:07,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=323, Unknown=1, NotChecked=36, Total=420 [2024-10-11 18:08:07,560 INFO L87 Difference]: Start difference. First operand 121 states and 131 transitions. Second operand has 20 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 18:08:07,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:08:07,893 INFO L93 Difference]: Finished difference Result 118 states and 128 transitions. [2024-10-11 18:08:07,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 18:08:07,894 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2024-10-11 18:08:07,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:08:07,894 INFO L225 Difference]: With dead ends: 118 [2024-10-11 18:08:07,894 INFO L226 Difference]: Without dead ends: 118 [2024-10-11 18:08:07,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=593, Unknown=1, NotChecked=50, Total=756 [2024-10-11 18:08:07,895 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 14 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 69 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:08:07,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 425 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 403 Invalid, 0 Unknown, 69 Unchecked, 0.2s Time] [2024-10-11 18:08:07,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-11 18:08:07,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-10-11 18:08:07,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 89 states have (on average 1.3707865168539326) internal successors, (122), 113 states have internal predecessors, (122), 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 18:08:07,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 128 transitions. [2024-10-11 18:08:07,899 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 128 transitions. Word has length 34 [2024-10-11 18:08:07,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:08:07,899 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 128 transitions. [2024-10-11 18:08:07,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 18:08:07,900 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 128 transitions. [2024-10-11 18:08:07,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 18:08:07,900 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:08:07,900 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:08:07,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-11 18:08:08,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:08:08,105 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-11 18:08:08,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:08:08,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1004834962, now seen corresponding path program 1 times [2024-10-11 18:08:08,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:08:08,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423028438] [2024-10-11 18:08:08,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:08:08,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:08:08,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:08,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:08:08,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:08,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 18:08:08,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:08,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 18:08:08,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:08,925 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 18:08:08,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:08:08,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423028438] [2024-10-11 18:08:08,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423028438] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:08:08,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394447228] [2024-10-11 18:08:08,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:08:08,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:08:08,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:08:08,929 INFO L229 MonitoredProcess]: Starting monitored process 9 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 18:08:08,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 18:08:09,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:09,152 INFO L255 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-10-11 18:08:09,156 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:08:09,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-11 18:08:09,234 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:08:09,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:08:09,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-11 18:08:09,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 18:08:09,324 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 18:08:09,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-10-11 18:08:09,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-10-11 18:08:09,416 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 18:08:09,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-10-11 18:08:09,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-10-11 18:08:09,489 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 18:08:09,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-10-11 18:08:09,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-10-11 18:08:09,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 18 [2024-10-11 18:08:09,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-11 18:08:09,555 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2024-10-11 18:08:09,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:08:09,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 18:08:09,584 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:08:09,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:08:09,586 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-10-11 18:08:09,586 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:08:09,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394447228] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:08:09,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:08:09,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 26 [2024-10-11 18:08:09,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110045691] [2024-10-11 18:08:09,674 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:08:09,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-11 18:08:09,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:08:09,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-11 18:08:09,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=671, Unknown=1, NotChecked=52, Total=812 [2024-10-11 18:08:09,676 INFO L87 Difference]: Start difference. First operand 118 states and 128 transitions. Second operand has 27 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 21 states have internal predecessors, (43), 3 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 18:08:10,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:08:10,235 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2024-10-11 18:08:10,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 18:08:10,236 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 21 states have internal predecessors, (43), 3 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 34 [2024-10-11 18:08:10,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:08:10,236 INFO L225 Difference]: With dead ends: 112 [2024-10-11 18:08:10,236 INFO L226 Difference]: Without dead ends: 112 [2024-10-11 18:08:10,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=222, Invalid=1421, Unknown=1, NotChecked=78, Total=1722 [2024-10-11 18:08:10,237 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 28 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:08:10,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 555 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 585 Invalid, 0 Unknown, 77 Unchecked, 0.3s Time] [2024-10-11 18:08:10,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-11 18:08:10,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-10-11 18:08:10,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 89 states have (on average 1.303370786516854) internal successors, (116), 107 states have internal predecessors, (116), 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 18:08:10,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2024-10-11 18:08:10,240 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 34 [2024-10-11 18:08:10,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:08:10,240 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2024-10-11 18:08:10,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 21 states have internal predecessors, (43), 3 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-11 18:08:10,240 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2024-10-11 18:08:10,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 18:08:10,241 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:08:10,241 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:08:10,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-11 18:08:10,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-10-11 18:08:10,442 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-11 18:08:10,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:08:10,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1246706260, now seen corresponding path program 1 times [2024-10-11 18:08:10,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:08:10,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574122704] [2024-10-11 18:08:10,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:08:10,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:08:10,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:10,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:08:10,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:10,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:08:10,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:08:10,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574122704] [2024-10-11 18:08:10,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574122704] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:08:10,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:08:10,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 18:08:10,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717702488] [2024-10-11 18:08:10,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:08:10,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:08:10,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:08:10,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:08:10,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:08:10,601 INFO L87 Difference]: Start difference. First operand 112 states and 122 transitions. Second operand has 9 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:08:10,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:08:10,780 INFO L93 Difference]: Finished difference Result 116 states and 128 transitions. [2024-10-11 18:08:10,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:08:10,781 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2024-10-11 18:08:10,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:08:10,782 INFO L225 Difference]: With dead ends: 116 [2024-10-11 18:08:10,782 INFO L226 Difference]: Without dead ends: 116 [2024-10-11 18:08:10,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:08:10,783 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 21 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:08:10,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 215 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:08:10,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-11 18:08:10,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2024-10-11 18:08:10,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 92 states have (on average 1.326086956521739) internal successors, (122), 110 states have internal predecessors, (122), 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 18:08:10,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 128 transitions. [2024-10-11 18:08:10,789 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 128 transitions. Word has length 33 [2024-10-11 18:08:10,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:08:10,789 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 128 transitions. [2024-10-11 18:08:10,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:08:10,789 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 128 transitions. [2024-10-11 18:08:10,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 18:08:10,790 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:08:10,790 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:08:10,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-10-11 18:08:10,791 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-11 18:08:10,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:08:10,791 INFO L85 PathProgramCache]: Analyzing trace with hash -2043813662, now seen corresponding path program 1 times [2024-10-11 18:08:10,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:08:10,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135699040] [2024-10-11 18:08:10,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:08:10,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:08:10,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:11,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:08:11,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:11,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:08:11,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:08:11,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135699040] [2024-10-11 18:08:11,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135699040] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:08:11,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878649965] [2024-10-11 18:08:11,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:08:11,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:08:11,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:08:11,198 INFO L229 MonitoredProcess]: Starting monitored process 10 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 18:08:11,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 18:08:11,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:11,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-10-11 18:08:11,446 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:08:11,450 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 18:08:11,475 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 18:08:11,481 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 18:08:11,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-10-11 18:08:11,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-10-11 18:08:11,608 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-11 18:08:11,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-10-11 18:08:11,661 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:08:11,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 20 [2024-10-11 18:08:11,678 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-10-11 18:08:11,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2024-10-11 18:08:11,694 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:08:11,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 20 [2024-10-11 18:08:11,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2024-10-11 18:08:11,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2024-10-11 18:08:11,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2024-10-11 18:08:11,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2024-10-11 18:08:11,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 52 [2024-10-11 18:08:11,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2024-10-11 18:08:12,183 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 10 treesize of output 9 [2024-10-11 18:08:12,236 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-11 18:08:12,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-10-11 18:08:12,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:08:12,361 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:08:12,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 64 treesize of output 78 [2024-10-11 18:08:12,375 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:08:12,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 31 [2024-10-11 18:08:12,504 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:08:12,504 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:08:12,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-10-11 18:08:14,082 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:08:14,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 63 [2024-10-11 18:08:14,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 179 [2024-10-11 18:08:14,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 319 treesize of output 311 [2024-10-11 18:08:14,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 247 treesize of output 241 [2024-10-11 18:08:14,162 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:08:14,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 266 treesize of output 290 [2024-10-11 18:08:14,563 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:08:14,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 42 [2024-10-11 18:08:14,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 98 [2024-10-11 18:08:14,588 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:08:14,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 42 [2024-10-11 18:08:14,630 INFO L349 Elim1Store]: treesize reduction 5, result has 73.7 percent of original size [2024-10-11 18:08:14,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 155 treesize of output 156 [2024-10-11 18:08:14,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 190 [2024-10-11 18:08:14,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 77 [2024-10-11 18:08:14,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 316 treesize of output 308 [2024-10-11 18:08:14,677 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:08:14,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2024-10-11 18:08:14,688 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:08:14,701 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:08:14,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 84 [2024-10-11 18:08:14,712 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:08:14,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2024-10-11 18:08:15,224 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:08:15,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878649965] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:08:15,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:08:15,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19, 19] total 44 [2024-10-11 18:08:15,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951474420] [2024-10-11 18:08:15,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:08:15,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-10-11 18:08:15,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:08:15,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-10-11 18:08:15,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1714, Unknown=42, NotChecked=0, Total=1892 [2024-10-11 18:08:15,227 INFO L87 Difference]: Start difference. First operand 115 states and 128 transitions. Second operand has 44 states, 41 states have (on average 2.2439024390243905) internal successors, (92), 40 states have internal predecessors, (92), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:08:17,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:08:17,157 INFO L93 Difference]: Finished difference Result 150 states and 176 transitions. [2024-10-11 18:08:17,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-11 18:08:17,157 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 41 states have (on average 2.2439024390243905) internal successors, (92), 40 states have internal predecessors, (92), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2024-10-11 18:08:17,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:08:17,158 INFO L225 Difference]: With dead ends: 150 [2024-10-11 18:08:17,158 INFO L226 Difference]: Without dead ends: 150 [2024-10-11 18:08:17,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=266, Invalid=2990, Unknown=50, NotChecked=0, Total=3306 [2024-10-11 18:08:17,160 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 64 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 1453 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 1468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:08:17,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 582 Invalid, 1468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1453 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 18:08:17,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-11 18:08:17,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 135. [2024-10-11 18:08:17,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 112 states have (on average 1.4017857142857142) internal successors, (157), 130 states have internal predecessors, (157), 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 18:08:17,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 163 transitions. [2024-10-11 18:08:17,163 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 163 transitions. Word has length 36 [2024-10-11 18:08:17,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:08:17,163 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 163 transitions. [2024-10-11 18:08:17,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 41 states have (on average 2.2439024390243905) internal successors, (92), 40 states have internal predecessors, (92), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 18:08:17,164 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 163 transitions. [2024-10-11 18:08:17,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 18:08:17,164 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:08:17,164 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] [2024-10-11 18:08:17,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-11 18:08:17,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-10-11 18:08:17,365 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-11 18:08:17,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:08:17,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1912798244, now seen corresponding path program 1 times [2024-10-11 18:08:17,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:08:17,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330754867] [2024-10-11 18:08:17,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:08:17,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:08:17,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:17,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:08:17,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:17,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 18:08:17,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:17,630 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 18:08:17,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:08:17,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330754867] [2024-10-11 18:08:17,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330754867] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:08:17,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076226126] [2024-10-11 18:08:17,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:08:17,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:08:17,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:08:17,633 INFO L229 MonitoredProcess]: Starting monitored process 11 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 18:08:17,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 18:08:17,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:17,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-10-11 18:08:17,875 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:08:18,035 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:08:18,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:08:18,077 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 18:08:18,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 18:08:18,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-10-11 18:08:18,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:08:18,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 36 [2024-10-11 18:08:18,277 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 18:08:18,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 40 [2024-10-11 18:08:18,331 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 18:08:18,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 40 [2024-10-11 18:08:18,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2024-10-11 18:08:18,464 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:08:18,464 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:08:18,566 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3438 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|)) v_ArrVal_3438) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 8)) 0))) is different from false [2024-10-11 18:08:18,572 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3437 (Array Int Int)) (v_ArrVal_3438 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem12#1.base| v_ArrVal_3437))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|)) v_ArrVal_3438)) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 8)) 0))) is different from false [2024-10-11 18:08:18,581 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3437 (Array Int Int)) (v_ArrVal_3438 (Array Int Int))) (not (= (select (select (let ((.cse1 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (let ((.cse0 (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_3437))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_3438))) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 8)) 0))) is different from false [2024-10-11 18:08:18,591 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3435 Int) (v_ArrVal_3437 (Array Int Int)) (v_ArrVal_3438 (Array Int Int))) (not (= (select (select (let ((.cse1 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem11#1.base| (store (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem11#1.base|) (+ 16 |c_ULTIMATE.start_create_#t~mem11#1.offset|) v_ArrVal_3435)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_3437)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_3438))) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 8)) 0))) is different from false [2024-10-11 18:08:18,709 INFO L349 Elim1Store]: treesize reduction 19, result has 69.4 percent of original size [2024-10-11 18:08:18,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 152 treesize of output 129 [2024-10-11 18:08:18,754 INFO L349 Elim1Store]: treesize reduction 40, result has 37.5 percent of original size [2024-10-11 18:08:18,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 240 treesize of output 237 [2024-10-11 18:08:18,801 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:08:18,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 602 treesize of output 566 [2024-10-11 18:08:18,818 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:08:18,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 406 treesize of output 375 [2024-10-11 18:08:18,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 366 treesize of output 346 [2024-10-11 18:08:19,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-10-11 18:08:19,255 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:08:19,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 111 treesize of output 119 [2024-10-11 18:08:19,418 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:08:19,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2024-10-11 18:08:19,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076226126] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:08:19,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:08:19,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 19] total 27 [2024-10-11 18:08:19,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705758433] [2024-10-11 18:08:19,551 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:08:19,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-11 18:08:19,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:08:19,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-11 18:08:19,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1001, Unknown=31, NotChecked=268, Total=1406 [2024-10-11 18:08:19,552 INFO L87 Difference]: Start difference. First operand 135 states and 163 transitions. Second operand has 27 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 22 states have internal predecessors, (64), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:08:20,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:08:20,307 INFO L93 Difference]: Finished difference Result 135 states and 159 transitions. [2024-10-11 18:08:20,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 18:08:20,307 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 22 states have internal predecessors, (64), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 37 [2024-10-11 18:08:20,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:08:20,308 INFO L225 Difference]: With dead ends: 135 [2024-10-11 18:08:20,308 INFO L226 Difference]: Without dead ends: 135 [2024-10-11 18:08:20,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=212, Invalid=1838, Unknown=36, NotChecked=364, Total=2450 [2024-10-11 18:08:20,310 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 48 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:08:20,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 520 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 18:08:20,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-11 18:08:20,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 131. [2024-10-11 18:08:20,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 109 states have (on average 1.3394495412844036) internal successors, (146), 126 states have internal predecessors, (146), 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 18:08:20,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 152 transitions. [2024-10-11 18:08:20,316 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 152 transitions. Word has length 37 [2024-10-11 18:08:20,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:08:20,316 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 152 transitions. [2024-10-11 18:08:20,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 22 states have internal predecessors, (64), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:08:20,317 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 152 transitions. [2024-10-11 18:08:20,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 18:08:20,317 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:08:20,317 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:08:20,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-11 18:08:20,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:08:20,518 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-11 18:08:20,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:08:20,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1912752004, now seen corresponding path program 1 times [2024-10-11 18:08:20,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:08:20,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984435041] [2024-10-11 18:08:20,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:08:20,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:08:20,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:21,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:08:21,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:21,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 18:08:21,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:21,290 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:08:21,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:08:21,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984435041] [2024-10-11 18:08:21,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984435041] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:08:21,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847601214] [2024-10-11 18:08:21,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:08:21,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:08:21,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:08:21,292 INFO L229 MonitoredProcess]: Starting monitored process 12 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 18:08:21,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-11 18:08:21,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:21,531 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-10-11 18:08:21,534 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:08:21,670 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:08:21,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:08:21,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 18:08:21,801 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 18:08:21,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-10-11 18:08:21,849 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 18:08:21,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-10-11 18:08:21,882 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 18:08:21,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-10-11 18:08:22,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 18:08:22,028 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:08:22,028 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:08:22,144 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-10-11 18:08:22,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2024-10-11 18:08:22,400 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:08:22,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 129 treesize of output 80 [2024-10-11 18:08:22,418 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:08:22,419 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 4726 treesize of output 3987 [2024-10-11 18:08:22,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 433 treesize of output 397 [2024-10-11 18:08:22,473 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:08:22,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 397 treesize of output 285 [2024-10-11 18:08:22,487 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:08:22,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 110 [2024-10-11 18:08:22,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847601214] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:08:22,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:08:22,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 32 [2024-10-11 18:08:22,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792504648] [2024-10-11 18:08:22,824 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:08:22,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-11 18:08:22,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:08:22,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-11 18:08:22,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1707, Unknown=20, NotChecked=0, Total=1892 [2024-10-11 18:08:22,826 INFO L87 Difference]: Start difference. First operand 131 states and 152 transitions. Second operand has 33 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 27 states have internal predecessors, (59), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:08:23,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:08:23,426 INFO L93 Difference]: Finished difference Result 135 states and 158 transitions. [2024-10-11 18:08:23,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 18:08:23,427 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 27 states have internal predecessors, (59), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 37 [2024-10-11 18:08:23,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:08:23,427 INFO L225 Difference]: With dead ends: 135 [2024-10-11 18:08:23,427 INFO L226 Difference]: Without dead ends: 135 [2024-10-11 18:08:23,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 694 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=277, Invalid=2459, Unknown=20, NotChecked=0, Total=2756 [2024-10-11 18:08:23,428 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 17 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:08:23,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 920 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 18:08:23,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-11 18:08:23,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2024-10-11 18:08:23,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 112 states have (on average 1.3392857142857142) internal successors, (150), 129 states have internal predecessors, (150), 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 18:08:23,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 156 transitions. [2024-10-11 18:08:23,432 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 156 transitions. Word has length 37 [2024-10-11 18:08:23,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:08:23,433 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 156 transitions. [2024-10-11 18:08:23,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 27 states have internal predecessors, (59), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:08:23,433 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 156 transitions. [2024-10-11 18:08:23,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 18:08:23,433 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:08:23,434 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:08:23,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-11 18:08:23,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2024-10-11 18:08:23,634 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-11 18:08:23,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:08:23,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1912752003, now seen corresponding path program 1 times [2024-10-11 18:08:23,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:08:23,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163743059] [2024-10-11 18:08:23,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:08:23,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:08:23,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:24,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:08:24,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:24,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 18:08:24,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:24,625 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:08:24,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:08:24,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163743059] [2024-10-11 18:08:24,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163743059] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:08:24,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881982133] [2024-10-11 18:08:24,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:08:24,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:08:24,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:08:24,628 INFO L229 MonitoredProcess]: Starting monitored process 13 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 18:08:24,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-11 18:08:24,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:24,902 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-10-11 18:08:24,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:08:25,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-11 18:08:25,073 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:08:25,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:08:25,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-11 18:08:25,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 18:08:25,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:08:25,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 45 [2024-10-11 18:08:25,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-10-11 18:08:25,273 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 18:08:25,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-10-11 18:08:25,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-10-11 18:08:25,321 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 18:08:25,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-10-11 18:08:25,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-10-11 18:08:25,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 18:08:25,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-11 18:08:25,492 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:08:25,492 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:08:26,163 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:08:26,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 296 treesize of output 297 [2024-10-11 18:08:26,198 INFO L349 Elim1Store]: treesize reduction 19, result has 69.4 percent of original size [2024-10-11 18:08:26,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 243 treesize of output 179 [2024-10-11 18:08:26,212 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:08:26,212 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 1550 treesize of output 1531 [2024-10-11 18:08:26,281 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:08:26,282 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 27276 treesize of output 26981 [2024-10-11 18:08:26,445 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:08:26,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1642 treesize of output 1490 [2024-10-11 18:08:26,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1482 treesize of output 1402 [2024-10-11 18:08:26,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1402 treesize of output 1322 [2024-10-11 18:08:26,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1151 treesize of output 1135 [2024-10-11 18:08:26,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1306 treesize of output 1266 [2024-10-11 18:08:26,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-10-11 18:08:26,938 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:08:26,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 119 [2024-10-11 18:08:27,129 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:08:27,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 142 [2024-10-11 18:08:27,131 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:08:27,135 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:08:27,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2024-10-11 18:08:27,137 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:08:27,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2024-10-11 18:08:27,144 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:08:27,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:08:27,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-10-11 18:08:27,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881982133] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:08:27,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:08:27,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 35 [2024-10-11 18:08:27,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25106151] [2024-10-11 18:08:27,271 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:08:27,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-10-11 18:08:27,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:08:27,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-10-11 18:08:27,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2030, Unknown=25, NotChecked=0, Total=2256 [2024-10-11 18:08:27,272 INFO L87 Difference]: Start difference. First operand 134 states and 156 transitions. Second operand has 36 states, 31 states have (on average 2.096774193548387) internal successors, (65), 30 states have internal predecessors, (65), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:08:27,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:08:27,800 INFO L93 Difference]: Finished difference Result 135 states and 157 transitions. [2024-10-11 18:08:27,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 18:08:27,800 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 31 states have (on average 2.096774193548387) internal successors, (65), 30 states have internal predecessors, (65), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 37 [2024-10-11 18:08:27,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:08:27,801 INFO L225 Difference]: With dead ends: 135 [2024-10-11 18:08:27,801 INFO L226 Difference]: Without dead ends: 135 [2024-10-11 18:08:27,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 934 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=296, Invalid=2541, Unknown=25, NotChecked=0, Total=2862 [2024-10-11 18:08:27,802 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 21 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:08:27,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 714 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:08:27,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-11 18:08:27,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2024-10-11 18:08:27,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 112 states have (on average 1.3303571428571428) internal successors, (149), 129 states have internal predecessors, (149), 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 18:08:27,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 155 transitions. [2024-10-11 18:08:27,806 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 155 transitions. Word has length 37 [2024-10-11 18:08:27,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:08:27,807 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 155 transitions. [2024-10-11 18:08:27,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 31 states have (on average 2.096774193548387) internal successors, (65), 30 states have internal predecessors, (65), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-11 18:08:27,807 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 155 transitions. [2024-10-11 18:08:27,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 18:08:27,807 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:08:27,808 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:08:27,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-11 18:08:28,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:08:28,008 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-11 18:08:28,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:08:28,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1742710415, now seen corresponding path program 1 times [2024-10-11 18:08:28,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:08:28,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740371350] [2024-10-11 18:08:28,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:08:28,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:08:28,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:28,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:08:28,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:28,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 18:08:28,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:28,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 18:08:28,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:28,819 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 18:08:28,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:08:28,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740371350] [2024-10-11 18:08:28,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740371350] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:08:28,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558094230] [2024-10-11 18:08:28,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:08:28,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:08:28,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:08:28,822 INFO L229 MonitoredProcess]: Starting monitored process 14 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 18:08:28,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-11 18:08:29,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:29,132 INFO L255 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-10-11 18:08:29,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:08:29,197 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:08:29,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:08:29,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 18:08:29,279 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 18:08:29,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-10-11 18:08:29,326 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 18:08:29,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-10-11 18:08:29,376 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 18:08:29,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-10-11 18:08:29,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-10-11 18:08:29,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-11 18:08:29,467 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:08:29,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:08:29,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-11 18:08:29,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-11 18:08:29,570 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 18:08:29,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-10-11 18:08:29,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-10-11 18:08:29,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-10-11 18:08:29,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-10-11 18:08:29,605 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 18:08:29,606 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:08:29,661 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (and (forall ((v_ArrVal_4098 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_4098) |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))) (forall ((v_ArrVal_4097 (Array Int Int)) (v_ArrVal_4098 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_4098) |c_ULTIMATE.start_create_~now~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem11#1.base| v_ArrVal_4097) |c_ULTIMATE.start_create_~now~0#1.base|) .cse0)))))) is different from false [2024-10-11 18:08:29,671 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4098 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_4098) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) (forall ((v_ArrVal_4097 (Array Int Int)) (v_ArrVal_4098 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_4098) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_4097) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))))))) is different from false [2024-10-11 18:08:29,678 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:08:29,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-10-11 18:08:29,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2024-10-11 18:08:29,688 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:08:29,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2024-10-11 18:08:29,693 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:08:29,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2024-10-11 18:08:29,695 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:08:29,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2024-10-11 18:08:29,698 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:08:29,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-10-11 18:08:29,922 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4092 (Array Int Int))) (not (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem13#1.base| v_ArrVal_4092) |c_ULTIMATE.start_create_~now~0#1.base|) (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) 0))) is different from false [2024-10-11 18:08:30,027 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2024-10-11 18:08:30,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 57 [2024-10-11 18:08:30,199 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2024-10-11 18:08:30,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558094230] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:08:30,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:08:30,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 20] total 47 [2024-10-11 18:08:30,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873946353] [2024-10-11 18:08:30,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:08:30,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-10-11 18:08:30,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:08:30,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-10-11 18:08:30,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1790, Unknown=29, NotChecked=264, Total=2256 [2024-10-11 18:08:30,201 INFO L87 Difference]: Start difference. First operand 134 states and 155 transitions. Second operand has 48 states, 42 states have (on average 1.6666666666666667) internal successors, (70), 40 states have internal predecessors, (70), 3 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (7), 6 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 18:08:30,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:08:30,883 INFO L93 Difference]: Finished difference Result 133 states and 154 transitions. [2024-10-11 18:08:30,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 18:08:30,884 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 42 states have (on average 1.6666666666666667) internal successors, (70), 40 states have internal predecessors, (70), 3 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (7), 6 states have call predecessors, (7), 3 states have call successors, (7) Word has length 38 [2024-10-11 18:08:30,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:08:30,885 INFO L225 Difference]: With dead ends: 133 [2024-10-11 18:08:30,885 INFO L226 Difference]: Without dead ends: 133 [2024-10-11 18:08:30,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 744 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=269, Invalid=2366, Unknown=29, NotChecked=306, Total=2970 [2024-10-11 18:08:30,887 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 22 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:08:30,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 872 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 700 Invalid, 0 Unknown, 102 Unchecked, 0.4s Time] [2024-10-11 18:08:30,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-11 18:08:30,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-10-11 18:08:30,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 112 states have (on average 1.3214285714285714) internal successors, (148), 128 states have internal predecessors, (148), 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 18:08:30,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 154 transitions. [2024-10-11 18:08:30,891 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 154 transitions. Word has length 38 [2024-10-11 18:08:30,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:08:30,892 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 154 transitions. [2024-10-11 18:08:30,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 42 states have (on average 1.6666666666666667) internal successors, (70), 40 states have internal predecessors, (70), 3 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (7), 6 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 18:08:30,892 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 154 transitions. [2024-10-11 18:08:30,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 18:08:30,893 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:08:30,893 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:08:30,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-11 18:08:31,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:08:31,098 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2024-10-11 18:08:31,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:08:31,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1066284515, now seen corresponding path program 1 times [2024-10-11 18:08:31,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:08:31,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514192260] [2024-10-11 18:08:31,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:08:31,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:08:31,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:32,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:08:32,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:32,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:08:32,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:08:32,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514192260] [2024-10-11 18:08:32,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514192260] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:08:32,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694163698] [2024-10-11 18:08:32,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:08:32,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:08:32,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:08:32,137 INFO L229 MonitoredProcess]: Starting monitored process 15 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 18:08:32,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-11 18:08:32,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:08:32,397 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-10-11 18:08:32,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:08:32,461 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-11 18:08:32,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 27 [2024-10-11 18:08:32,525 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2024-10-11 18:08:32,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 37 [2024-10-11 18:08:32,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 18:08:32,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 39 [2024-10-11 18:08:34,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:08:34,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:08:34,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 1670 treesize of output 876