./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-broom/sll-nested-sll.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-broom/sll-nested-sll.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 89b7500933072598b3ae86cb9a0697a1fc30e47e1dd961db3afeb42e68cfc79e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 18:52:39,464 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 18:52:39,509 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-22 18:52:39,522 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 18:52:39,522 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 18:52:39,546 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 18:52:39,546 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 18:52:39,546 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 18:52:39,547 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 18:52:39,548 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 18:52:39,548 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 18:52:39,548 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 18:52:39,548 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 18:52:39,549 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 18:52:39,550 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 18:52:39,550 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 18:52:39,550 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 18:52:39,551 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 18:52:39,551 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 18:52:39,551 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 18:52:39,551 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 18:52:39,552 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 18:52:39,552 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 18:52:39,552 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 18:52:39,552 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 18:52:39,553 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 18:52:39,553 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 18:52:39,553 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 18:52:39,553 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 18:52:39,553 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 18:52:39,554 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:52:39,554 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 18:52:39,554 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 18:52:39,554 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 18:52:39,554 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 18:52:39,555 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 18:52:39,555 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 18:52:39,555 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 18:52:39,555 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 18:52:39,555 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 89b7500933072598b3ae86cb9a0697a1fc30e47e1dd961db3afeb42e68cfc79e [2024-11-22 18:52:39,774 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 18:52:39,796 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 18:52:39,799 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 18:52:39,800 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 18:52:39,800 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 18:52:39,801 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-broom/sll-nested-sll.i [2024-11-22 18:52:40,959 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 18:52:41,196 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 18:52:41,197 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-nested-sll.i [2024-11-22 18:52:41,219 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4447d43c1/d6b467fd15f24dd0ab552dcfdd00eb08/FLAGf06e0f4c5 [2024-11-22 18:52:41,538 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4447d43c1/d6b467fd15f24dd0ab552dcfdd00eb08 [2024-11-22 18:52:41,541 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 18:52:41,542 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 18:52:41,543 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 18:52:41,543 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 18:52:41,551 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 18:52:41,552 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:52:41" (1/1) ... [2024-11-22 18:52:41,554 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@236c5a6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:52:41, skipping insertion in model container [2024-11-22 18:52:41,554 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:52:41" (1/1) ... [2024-11-22 18:52:41,604 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 18:52:41,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:52:41,905 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 18:52:41,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:52:41,963 INFO L204 MainTranslator]: Completed translation [2024-11-22 18:52:41,964 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:52:41 WrapperNode [2024-11-22 18:52:41,964 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 18:52:41,965 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 18:52:41,965 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 18:52:41,965 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 18:52:41,970 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:52:41" (1/1) ... [2024-11-22 18:52:41,979 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:52:41" (1/1) ... [2024-11-22 18:52:41,997 INFO L138 Inliner]: procedures = 122, calls = 33, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 89 [2024-11-22 18:52:41,997 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 18:52:41,998 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 18:52:41,998 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 18:52:41,998 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 18:52:42,006 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:52:41" (1/1) ... [2024-11-22 18:52:42,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:52:41" (1/1) ... [2024-11-22 18:52:42,009 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:52:41" (1/1) ... [2024-11-22 18:52:42,027 INFO L175 MemorySlicer]: Split 16 memory accesses to 1 slices as follows [16]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 7 writes are split as follows [7]. [2024-11-22 18:52:42,028 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:52:41" (1/1) ... [2024-11-22 18:52:42,028 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:52:41" (1/1) ... [2024-11-22 18:52:42,036 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:52:41" (1/1) ... [2024-11-22 18:52:42,038 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:52:41" (1/1) ... [2024-11-22 18:52:42,039 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:52:41" (1/1) ... [2024-11-22 18:52:42,040 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:52:41" (1/1) ... [2024-11-22 18:52:42,042 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 18:52:42,043 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 18:52:42,043 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 18:52:42,043 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 18:52:42,043 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:52:41" (1/1) ... [2024-11-22 18:52:42,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:52:42,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:52:42,071 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 18:52:42,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 18:52:42,105 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero_internal [2024-11-22 18:52:42,106 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero_internal [2024-11-22 18:52:42,106 INFO L130 BoogieDeclarations]: Found specification of procedure create_internal [2024-11-22 18:52:42,106 INFO L138 BoogieDeclarations]: Found implementation of procedure create_internal [2024-11-22 18:52:42,106 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2024-11-22 18:52:42,106 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2024-11-22 18:52:42,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-22 18:52:42,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-22 18:52:42,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-22 18:52:42,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-22 18:52:42,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 18:52:42,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 18:52:42,189 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 18:52:42,190 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 18:52:42,428 INFO L? ?]: Removed 110 outVars from TransFormulas that were not future-live. [2024-11-22 18:52:42,428 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 18:52:42,443 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 18:52:42,444 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-22 18:52:42,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:52:42 BoogieIcfgContainer [2024-11-22 18:52:42,444 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 18:52:42,446 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 18:52:42,446 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 18:52:42,448 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 18:52:42,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 06:52:41" (1/3) ... [2024-11-22 18:52:42,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45e98a67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:52:42, skipping insertion in model container [2024-11-22 18:52:42,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:52:41" (2/3) ... [2024-11-22 18:52:42,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45e98a67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:52:42, skipping insertion in model container [2024-11-22 18:52:42,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:52:42" (3/3) ... [2024-11-22 18:52:42,450 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-nested-sll.i [2024-11-22 18:52:42,462 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 18:52:42,462 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2024-11-22 18:52:42,494 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 18:52:42,499 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;@17c9ef79, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 18:52:42,499 INFO L334 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2024-11-22 18:52:42,503 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 62 states have (on average 1.8225806451612903) internal successors, (113), 101 states have internal predecessors, (113), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 18:52:42,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-22 18:52:42,508 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:52:42,509 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-22 18:52:42,509 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 36 more)] === [2024-11-22 18:52:42,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:52:42,514 INFO L85 PathProgramCache]: Analyzing trace with hash 37437679, now seen corresponding path program 1 times [2024-11-22 18:52:42,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:52:42,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682852287] [2024-11-22 18:52:42,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:42,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:52:42,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:42,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:52:42,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:52:42,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682852287] [2024-11-22 18:52:42,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682852287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:52:42,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:52:42,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:52:42,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358821629] [2024-11-22 18:52:42,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:52:42,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:52:42,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:52:42,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:52:42,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:52:42,772 INFO L87 Difference]: Start difference. First operand has 111 states, 62 states have (on average 1.8225806451612903) internal successors, (113), 101 states have internal predecessors, (113), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-11-22 18:52:42,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:52:42,875 INFO L93 Difference]: Finished difference Result 109 states and 117 transitions. [2024-11-22 18:52:42,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:52:42,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2024-11-22 18:52:42,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:52:42,888 INFO L225 Difference]: With dead ends: 109 [2024-11-22 18:52:42,888 INFO L226 Difference]: Without dead ends: 107 [2024-11-22 18:52:42,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:52:42,893 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 2 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:52:42,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 186 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:52:42,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-22 18:52:42,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-22 18:52:42,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 61 states have (on average 1.6885245901639345) internal successors, (103), 97 states have internal predecessors, (103), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 18:52:42,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2024-11-22 18:52:42,944 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 5 [2024-11-22 18:52:42,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:52:42,955 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2024-11-22 18:52:42,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-11-22 18:52:42,955 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2024-11-22 18:52:42,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-22 18:52:42,956 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:52:42,956 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-22 18:52:42,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 18:52:42,956 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 36 more)] === [2024-11-22 18:52:42,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:52:42,957 INFO L85 PathProgramCache]: Analyzing trace with hash 37437680, now seen corresponding path program 1 times [2024-11-22 18:52:42,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:52:42,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125605905] [2024-11-22 18:52:42,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:42,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:52:42,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:43,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:52:43,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:52:43,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125605905] [2024-11-22 18:52:43,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125605905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:52:43,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:52:43,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:52:43,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873009269] [2024-11-22 18:52:43,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:52:43,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:52:43,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:52:43,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:52:43,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:52:43,063 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-11-22 18:52:43,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:52:43,128 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2024-11-22 18:52:43,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:52:43,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2024-11-22 18:52:43,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:52:43,130 INFO L225 Difference]: With dead ends: 105 [2024-11-22 18:52:43,131 INFO L226 Difference]: Without dead ends: 105 [2024-11-22 18:52:43,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:52:43,132 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 2 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:52:43,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 190 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:52:43,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-22 18:52:43,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-22 18:52:43,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 61 states have (on average 1.6557377049180328) internal successors, (101), 95 states have internal predecessors, (101), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 18:52:43,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 113 transitions. [2024-11-22 18:52:43,149 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 113 transitions. Word has length 5 [2024-11-22 18:52:43,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:52:43,149 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 113 transitions. [2024-11-22 18:52:43,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-11-22 18:52:43,151 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 113 transitions. [2024-11-22 18:52:43,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-22 18:52:43,151 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:52:43,151 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:52:43,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 18:52:43,152 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting alloc_and_zero_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-22 18:52:43,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:52:43,155 INFO L85 PathProgramCache]: Analyzing trace with hash -952868549, now seen corresponding path program 1 times [2024-11-22 18:52:43,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:52:43,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636770192] [2024-11-22 18:52:43,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:43,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:52:43,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:43,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-11-22 18:52:43,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:52:43,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636770192] [2024-11-22 18:52:43,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636770192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:52:43,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:52:43,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:52:43,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43326891] [2024-11-22 18:52:43,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:52:43,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:52:43,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:52:43,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:52:43,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:52:43,264 INFO L87 Difference]: Start difference. First operand 105 states and 113 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 18:52:43,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:52:43,334 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2024-11-22 18:52:43,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:52:43,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-22 18:52:43,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:52:43,336 INFO L225 Difference]: With dead ends: 104 [2024-11-22 18:52:43,338 INFO L226 Difference]: Without dead ends: 104 [2024-11-22 18:52:43,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:52:43,339 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 1 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:52:43,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 181 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:52:43,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-22 18:52:43,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-22 18:52:43,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 61 states have (on average 1.639344262295082) internal successors, (100), 94 states have internal predecessors, (100), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 18:52:43,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2024-11-22 18:52:43,351 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 14 [2024-11-22 18:52:43,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:52:43,352 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2024-11-22 18:52:43,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 18:52:43,353 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2024-11-22 18:52:43,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-22 18:52:43,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:52:43,353 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:52:43,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 18:52:43,354 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting alloc_and_zero_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-22 18:52:43,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:52:43,354 INFO L85 PathProgramCache]: Analyzing trace with hash -952868548, now seen corresponding path program 1 times [2024-11-22 18:52:43,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:52:43,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909407484] [2024-11-22 18:52:43,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:43,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:52:43,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:43,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:52:43,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:52:43,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909407484] [2024-11-22 18:52:43,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909407484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:52:43,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:52:43,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:52:43,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478541658] [2024-11-22 18:52:43,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:52:43,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:52:43,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:52:43,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:52:43,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:52:43,445 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 18:52:43,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:52:43,509 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2024-11-22 18:52:43,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:52:43,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-22 18:52:43,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:52:43,511 INFO L225 Difference]: With dead ends: 103 [2024-11-22 18:52:43,512 INFO L226 Difference]: Without dead ends: 103 [2024-11-22 18:52:43,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:52:43,513 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 1 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:52:43,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 188 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:52:43,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-22 18:52:43,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-22 18:52:43,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 61 states have (on average 1.6229508196721312) internal successors, (99), 93 states have internal predecessors, (99), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 18:52:43,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2024-11-22 18:52:43,525 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 14 [2024-11-22 18:52:43,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:52:43,525 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2024-11-22 18:52:43,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 18:52:43,525 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2024-11-22 18:52:43,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-22 18:52:43,526 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:52:43,526 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-11-22 18:52:43,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 18:52:43,528 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-22 18:52:43,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:52:43,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1730782214, now seen corresponding path program 1 times [2024-11-22 18:52:43,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:52:43,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839377552] [2024-11-22 18:52:43,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:43,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:52:43,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:43,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:52:43,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:52:43,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839377552] [2024-11-22 18:52:43,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839377552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:52:43,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:52:43,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 18:52:43,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433934464] [2024-11-22 18:52:43,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:52:43,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 18:52:43,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:52:43,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 18:52:43,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-22 18:52:43,824 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 18:52:44,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:52:44,120 INFO L93 Difference]: Finished difference Result 120 states and 136 transitions. [2024-11-22 18:52:44,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 18:52:44,121 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 24 [2024-11-22 18:52:44,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:52:44,124 INFO L225 Difference]: With dead ends: 120 [2024-11-22 18:52:44,124 INFO L226 Difference]: Without dead ends: 120 [2024-11-22 18:52:44,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-22 18:52:44,128 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 18 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:52:44,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 468 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:52:44,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-22 18:52:44,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 115. [2024-11-22 18:52:44,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 72 states have (on average 1.6111111111111112) internal successors, (116), 102 states have internal predecessors, (116), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-22 18:52:44,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 132 transitions. [2024-11-22 18:52:44,139 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 132 transitions. Word has length 24 [2024-11-22 18:52:44,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:52:44,139 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 132 transitions. [2024-11-22 18:52:44,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 18:52:44,139 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 132 transitions. [2024-11-22 18:52:44,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-22 18:52:44,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:52:44,140 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-11-22 18:52:44,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 18:52:44,142 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-22 18:52:44,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:52:44,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1730782213, now seen corresponding path program 1 times [2024-11-22 18:52:44,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:52:44,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229647193] [2024-11-22 18:52:44,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:44,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:52:44,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:44,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:52:44,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:52:44,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229647193] [2024-11-22 18:52:44,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229647193] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:52:44,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:52:44,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 18:52:44,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612158593] [2024-11-22 18:52:44,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:52:44,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 18:52:44,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:52:44,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 18:52:44,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-22 18:52:44,466 INFO L87 Difference]: Start difference. First operand 115 states and 132 transitions. Second operand has 10 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 18:52:44,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:52:44,774 INFO L93 Difference]: Finished difference Result 131 states and 152 transitions. [2024-11-22 18:52:44,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 18:52:44,774 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 24 [2024-11-22 18:52:44,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:52:44,775 INFO L225 Difference]: With dead ends: 131 [2024-11-22 18:52:44,775 INFO L226 Difference]: Without dead ends: 131 [2024-11-22 18:52:44,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-22 18:52:44,776 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 16 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 18:52:44,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 463 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 18:52:44,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-22 18:52:44,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 126. [2024-11-22 18:52:44,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 81 states have (on average 1.5679012345679013) internal successors, (127), 111 states have internal predecessors, (127), 9 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (12), 11 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-22 18:52:44,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 148 transitions. [2024-11-22 18:52:44,786 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 148 transitions. Word has length 24 [2024-11-22 18:52:44,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:52:44,788 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 148 transitions. [2024-11-22 18:52:44,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-22 18:52:44,788 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 148 transitions. [2024-11-22 18:52:44,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-22 18:52:44,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:52:44,789 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] [2024-11-22 18:52:44,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 18:52:44,790 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting create_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-22 18:52:44,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:52:44,790 INFO L85 PathProgramCache]: Analyzing trace with hash -314607673, now seen corresponding path program 1 times [2024-11-22 18:52:44,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:52:44,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685112279] [2024-11-22 18:52:44,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:44,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:52:44,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:44,969 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:52:44,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:52:44,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685112279] [2024-11-22 18:52:44,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685112279] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:52:44,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577525514] [2024-11-22 18:52:44,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:44,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:52:44,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:52:44,974 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:52:44,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 18:52:45,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:45,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-22 18:52:45,056 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:52:45,108 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-11-22 18:52:45,139 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) is different from true [2024-11-22 18:52:45,176 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-22 18:52:45,176 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-11-22 18:52:45,192 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-22 18:52:45,192 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:52:45,361 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:52:45,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577525514] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:52:45,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:52:45,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 11 [2024-11-22 18:52:45,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784831834] [2024-11-22 18:52:45,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:52:45,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-22 18:52:45,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:52:45,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-22 18:52:45,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2024-11-22 18:52:45,363 INFO L87 Difference]: Start difference. First operand 126 states and 148 transitions. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 10 states have internal predecessors, (30), 2 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-22 18:52:45,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:52:45,644 INFO L93 Difference]: Finished difference Result 127 states and 151 transitions. [2024-11-22 18:52:45,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 18:52:45,644 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 10 states have internal predecessors, (30), 2 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 27 [2024-11-22 18:52:45,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:52:45,645 INFO L225 Difference]: With dead ends: 127 [2024-11-22 18:52:45,646 INFO L226 Difference]: Without dead ends: 127 [2024-11-22 18:52:45,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=164, Unknown=1, NotChecked=26, Total=240 [2024-11-22 18:52:45,647 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 39 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:52:45,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 504 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 335 Invalid, 0 Unknown, 116 Unchecked, 0.2s Time] [2024-11-22 18:52:45,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-22 18:52:45,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-11-22 18:52:45,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 82 states have (on average 1.5609756097560976) internal successors, (128), 111 states have internal predecessors, (128), 10 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (13), 12 states have call predecessors, (13), 10 states have call successors, (13) [2024-11-22 18:52:45,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 151 transitions. [2024-11-22 18:52:45,658 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 151 transitions. Word has length 27 [2024-11-22 18:52:45,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:52:45,659 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 151 transitions. [2024-11-22 18:52:45,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 10 states have internal predecessors, (30), 2 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-22 18:52:45,659 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 151 transitions. [2024-11-22 18:52:45,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-22 18:52:45,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:52:45,659 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] [2024-11-22 18:52:45,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-22 18:52:45,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:52:45,865 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting create_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-22 18:52:45,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:52:45,866 INFO L85 PathProgramCache]: Analyzing trace with hash -314607672, now seen corresponding path program 1 times [2024-11-22 18:52:45,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:52:45,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019640779] [2024-11-22 18:52:45,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:45,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:52:45,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:46,100 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:52:46,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:52:46,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019640779] [2024-11-22 18:52:46,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019640779] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:52:46,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695199761] [2024-11-22 18:52:46,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:46,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:52:46,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:52:46,103 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:52:46,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-22 18:52:46,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:46,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-22 18:52:46,170 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:52:46,177 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-11-22 18:52:46,272 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base 8) |c_#length|)) is different from true [2024-11-22 18:52:46,292 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-22 18:52:46,293 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-11-22 18:52:46,314 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-22 18:52:46,314 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:52:46,525 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:52:46,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695199761] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:52:46,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:52:46,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 20 [2024-11-22 18:52:46,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698771463] [2024-11-22 18:52:46,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:52:46,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-22 18:52:46,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:52:46,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-22 18:52:46,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=326, Unknown=1, NotChecked=36, Total=420 [2024-11-22 18:52:46,527 INFO L87 Difference]: Start difference. First operand 127 states and 151 transitions. Second operand has 21 states, 20 states have (on average 2.15) internal successors, (43), 15 states have internal predecessors, (43), 4 states have call successors, (6), 4 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-22 18:52:47,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:52:47,144 INFO L93 Difference]: Finished difference Result 128 states and 151 transitions. [2024-11-22 18:52:47,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-22 18:52:47,145 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.15) internal successors, (43), 15 states have internal predecessors, (43), 4 states have call successors, (6), 4 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) Word has length 27 [2024-11-22 18:52:47,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:52:47,145 INFO L225 Difference]: With dead ends: 128 [2024-11-22 18:52:47,145 INFO L226 Difference]: Without dead ends: 128 [2024-11-22 18:52:47,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=639, Unknown=1, NotChecked=52, Total=812 [2024-11-22 18:52:47,146 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 49 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 18:52:47,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 736 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 446 Invalid, 0 Unknown, 116 Unchecked, 0.4s Time] [2024-11-22 18:52:47,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-22 18:52:47,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2024-11-22 18:52:47,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 82 states have (on average 1.5365853658536586) internal successors, (126), 110 states have internal predecessors, (126), 10 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (13), 12 states have call predecessors, (13), 10 states have call successors, (13) [2024-11-22 18:52:47,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 149 transitions. [2024-11-22 18:52:47,155 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 149 transitions. Word has length 27 [2024-11-22 18:52:47,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:52:47,155 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 149 transitions. [2024-11-22 18:52:47,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.15) internal successors, (43), 15 states have internal predecessors, (43), 4 states have call successors, (6), 4 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-22 18:52:47,155 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 149 transitions. [2024-11-22 18:52:47,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-22 18:52:47,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:52:47,155 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-11-22 18:52:47,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-22 18:52:47,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-22 18:52:47,356 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-22 18:52:47,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:52:47,357 INFO L85 PathProgramCache]: Analyzing trace with hash -531170560, now seen corresponding path program 1 times [2024-11-22 18:52:47,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:52:47,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779060022] [2024-11-22 18:52:47,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:47,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:52:47,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:47,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:52:47,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:52:47,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779060022] [2024-11-22 18:52:47,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779060022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:52:47,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:52:47,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 18:52:47,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177031831] [2024-11-22 18:52:47,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:52:47,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 18:52:47,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:52:47,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 18:52:47,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:52:47,421 INFO L87 Difference]: Start difference. First operand 126 states and 149 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 18:52:47,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:52:47,530 INFO L93 Difference]: Finished difference Result 146 states and 180 transitions. [2024-11-22 18:52:47,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 18:52:47,531 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2024-11-22 18:52:47,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:52:47,532 INFO L225 Difference]: With dead ends: 146 [2024-11-22 18:52:47,533 INFO L226 Difference]: Without dead ends: 146 [2024-11-22 18:52:47,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:52:47,533 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 27 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:52:47,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 335 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:52:47,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-22 18:52:47,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 141. [2024-11-22 18:52:47,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 97 states have (on average 1.556701030927835) internal successors, (151), 123 states have internal predecessors, (151), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (15), 14 states have call predecessors, (15), 11 states have call successors, (15) [2024-11-22 18:52:47,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 177 transitions. [2024-11-22 18:52:47,539 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 177 transitions. Word has length 31 [2024-11-22 18:52:47,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:52:47,539 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 177 transitions. [2024-11-22 18:52:47,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 18:52:47,539 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 177 transitions. [2024-11-22 18:52:47,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-22 18:52:47,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:52:47,543 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-11-22 18:52:47,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 18:52:47,545 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-22 18:52:47,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:52:47,545 INFO L85 PathProgramCache]: Analyzing trace with hash -531170559, now seen corresponding path program 1 times [2024-11-22 18:52:47,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:52:47,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353114084] [2024-11-22 18:52:47,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:47,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:52:47,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:47,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:52:47,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:52:47,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353114084] [2024-11-22 18:52:47,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353114084] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:52:47,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:52:47,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 18:52:47,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188301802] [2024-11-22 18:52:47,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:52:47,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 18:52:47,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:52:47,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 18:52:47,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-22 18:52:47,690 INFO L87 Difference]: Start difference. First operand 141 states and 177 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 18:52:47,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:52:47,829 INFO L93 Difference]: Finished difference Result 155 states and 191 transitions. [2024-11-22 18:52:47,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 18:52:47,830 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2024-11-22 18:52:47,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:52:47,830 INFO L225 Difference]: With dead ends: 155 [2024-11-22 18:52:47,831 INFO L226 Difference]: Without dead ends: 155 [2024-11-22 18:52:47,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-22 18:52:47,831 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 22 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:52:47,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 611 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:52:47,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-22 18:52:47,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2024-11-22 18:52:47,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 107 states have (on average 1.5420560747663552) internal successors, (165), 133 states have internal predecessors, (165), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (15), 14 states have call predecessors, (15), 11 states have call successors, (15) [2024-11-22 18:52:47,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 191 transitions. [2024-11-22 18:52:47,836 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 191 transitions. Word has length 31 [2024-11-22 18:52:47,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:52:47,836 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 191 transitions. [2024-11-22 18:52:47,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 18:52:47,836 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 191 transitions. [2024-11-22 18:52:47,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-22 18:52:47,837 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:52:47,837 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:52:47,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 18:52:47,837 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-22 18:52:47,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:52:47,838 INFO L85 PathProgramCache]: Analyzing trace with hash 646169567, now seen corresponding path program 1 times [2024-11-22 18:52:47,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:52:47,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215908023] [2024-11-22 18:52:47,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:47,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:52:47,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:47,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:52:47,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:52:47,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215908023] [2024-11-22 18:52:47,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215908023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:52:47,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:52:47,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 18:52:47,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704590427] [2024-11-22 18:52:47,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:52:47,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 18:52:47,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:52:47,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 18:52:47,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-22 18:52:47,923 INFO L87 Difference]: Start difference. First operand 151 states and 191 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 18:52:47,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:52:47,967 INFO L93 Difference]: Finished difference Result 161 states and 203 transitions. [2024-11-22 18:52:47,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 18:52:47,968 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2024-11-22 18:52:47,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:52:47,969 INFO L225 Difference]: With dead ends: 161 [2024-11-22 18:52:47,969 INFO L226 Difference]: Without dead ends: 161 [2024-11-22 18:52:47,969 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-11-22 18:52:47,969 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 27 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:52:47,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 650 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:52:47,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-22 18:52:47,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 152. [2024-11-22 18:52:47,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 108 states have (on average 1.5185185185185186) internal successors, (164), 134 states have internal predecessors, (164), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (15), 14 states have call predecessors, (15), 11 states have call successors, (15) [2024-11-22 18:52:47,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 190 transitions. [2024-11-22 18:52:47,977 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 190 transitions. Word has length 33 [2024-11-22 18:52:47,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:52:47,978 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 190 transitions. [2024-11-22 18:52:47,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 18:52:47,979 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 190 transitions. [2024-11-22 18:52:47,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-22 18:52:47,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:52:47,981 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:52:47,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 18:52:47,981 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-22 18:52:47,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:52:47,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1442600445, now seen corresponding path program 1 times [2024-11-22 18:52:47,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:52:47,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587642120] [2024-11-22 18:52:47,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:47,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:52:47,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:48,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:52:48,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:52:48,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587642120] [2024-11-22 18:52:48,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587642120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:52:48,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:52:48,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-22 18:52:48,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140575665] [2024-11-22 18:52:48,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:52:48,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-22 18:52:48,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:52:48,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-22 18:52:48,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2024-11-22 18:52:48,378 INFO L87 Difference]: Start difference. First operand 152 states and 190 transitions. Second operand has 17 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 14 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 18:52:48,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:52:48,726 INFO L93 Difference]: Finished difference Result 168 states and 207 transitions. [2024-11-22 18:52:48,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-22 18:52:48,727 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 14 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2024-11-22 18:52:48,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:52:48,728 INFO L225 Difference]: With dead ends: 168 [2024-11-22 18:52:48,728 INFO L226 Difference]: Without dead ends: 168 [2024-11-22 18:52:48,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2024-11-22 18:52:48,728 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 32 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 18:52:48,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 880 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 18:52:48,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-22 18:52:48,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 159. [2024-11-22 18:52:48,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 115 states have (on average 1.5043478260869565) internal successors, (173), 141 states have internal predecessors, (173), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (15), 14 states have call predecessors, (15), 11 states have call successors, (15) [2024-11-22 18:52:48,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 199 transitions. [2024-11-22 18:52:48,736 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 199 transitions. Word has length 34 [2024-11-22 18:52:48,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:52:48,736 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 199 transitions. [2024-11-22 18:52:48,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 14 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 18:52:48,737 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 199 transitions. [2024-11-22 18:52:48,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-22 18:52:48,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:52:48,738 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] [2024-11-22 18:52:48,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-22 18:52:48,738 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-22 18:52:48,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:52:48,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1442600444, now seen corresponding path program 1 times [2024-11-22 18:52:48,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:52:48,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106030179] [2024-11-22 18:52:48,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:48,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:52:48,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:49,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:52:49,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:52:49,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106030179] [2024-11-22 18:52:49,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106030179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:52:49,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:52:49,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-22 18:52:49,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969878270] [2024-11-22 18:52:49,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:52:49,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-22 18:52:49,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:52:49,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-22 18:52:49,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2024-11-22 18:52:49,221 INFO L87 Difference]: Start difference. First operand 159 states and 199 transitions. Second operand has 17 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 14 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 18:52:49,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:52:49,559 INFO L93 Difference]: Finished difference Result 168 states and 206 transitions. [2024-11-22 18:52:49,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-22 18:52:49,559 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 14 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2024-11-22 18:52:49,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:52:49,560 INFO L225 Difference]: With dead ends: 168 [2024-11-22 18:52:49,560 INFO L226 Difference]: Without dead ends: 168 [2024-11-22 18:52:49,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2024-11-22 18:52:49,561 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 31 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 18:52:49,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 962 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 18:52:49,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-22 18:52:49,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 159. [2024-11-22 18:52:49,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 115 states have (on average 1.4956521739130435) internal successors, (172), 141 states have internal predecessors, (172), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (15), 14 states have call predecessors, (15), 11 states have call successors, (15) [2024-11-22 18:52:49,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 198 transitions. [2024-11-22 18:52:49,567 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 198 transitions. Word has length 34 [2024-11-22 18:52:49,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:52:49,567 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 198 transitions. [2024-11-22 18:52:49,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 14 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 18:52:49,567 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 198 transitions. [2024-11-22 18:52:49,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-22 18:52:49,567 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:52:49,567 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:52:49,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-22 18:52:49,568 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-22 18:52:49,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:52:49,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1166943868, now seen corresponding path program 1 times [2024-11-22 18:52:49,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:52:49,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403748523] [2024-11-22 18:52:49,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:49,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:52:49,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:49,912 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-22 18:52:49,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:52:49,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403748523] [2024-11-22 18:52:49,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403748523] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:52:49,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991335986] [2024-11-22 18:52:49,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:49,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:52:49,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:52:49,918 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:52:49,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-22 18:52:49,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:49,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-22 18:52:49,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:52:50,004 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-11-22 18:52:50,063 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) is different from true [2024-11-22 18:52:50,083 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_8|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| alloc_and_zero_internal_~pi~1.base 1)) (= .cse0 c_create_internal_~now~0.base) (= (store |c_old(#valid)| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0)) |v_#valid_BEFORE_CALL_8|)))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) is different from false [2024-11-22 18:52:50,085 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_8|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| alloc_and_zero_internal_~pi~1.base 1)) (= .cse0 c_create_internal_~now~0.base) (= (store |c_old(#valid)| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0)) |v_#valid_BEFORE_CALL_8|)))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) is different from true [2024-11-22 18:52:50,102 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_8|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse0) 1) (= (store |c_old(#valid)| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0)) |v_#valid_BEFORE_CALL_8|)))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) is different from false [2024-11-22 18:52:50,104 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_8|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse0) 1) (= (store |c_old(#valid)| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0)) |v_#valid_BEFORE_CALL_8|)))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) is different from true [2024-11-22 18:52:50,193 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-22 18:52:50,193 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-11-22 18:52:50,207 WARN L851 $PredicateComparison]: unable to prove that (or (and (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| alloc_and_zero_internal_~pi~1.base 1)) (= (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0)) |v_#valid_BEFORE_CALL_8|) (= (select |c_#valid| .cse0) 1)))) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_create_~now~1#1.base|) 1)))) is different from false [2024-11-22 18:52:50,209 WARN L873 $PredicateComparison]: unable to prove that (or (and (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| alloc_and_zero_internal_~pi~1.base 1)) (= (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0)) |v_#valid_BEFORE_CALL_8|) (= (select |c_#valid| .cse0) 1)))) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_create_~now~1#1.base|) 1)))) is different from true [2024-11-22 18:52:50,210 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2024-11-22 18:52:50,210 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:52:50,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991335986] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:52:50,428 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:52:50,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 18 [2024-11-22 18:52:50,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014557838] [2024-11-22 18:52:50,428 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:52:50,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-22 18:52:50,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:52:50,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-22 18:52:50,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=240, Unknown=7, NotChecked=140, Total=462 [2024-11-22 18:52:50,430 INFO L87 Difference]: Start difference. First operand 159 states and 198 transitions. Second operand has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 13 states have internal predecessors, (42), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-22 18:52:50,717 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse0 (select |c_#valid| .cse5))) (let ((.cse1 (store |c_old(#valid)| .cse5 .cse0))) (let ((.cse2 (@diff .cse1 |c_#valid|))) (let ((.cse3 (select |c_#valid| .cse2))) (and (or (= |c_#valid| |c_old(#valid)|) (= .cse0 1)) (= |c_#valid| (store .cse1 .cse2 .cse3)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse4 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_8|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| alloc_and_zero_internal_~pi~1.base 1)) (= .cse4 c_create_internal_~now~0.base) (= (store |c_old(#valid)| .cse4 (select |v_#valid_BEFORE_CALL_8| .cse4)) |v_#valid_BEFORE_CALL_8|)))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) (or (= .cse3 1) (= |c_#valid| .cse1)))))))) is different from false [2024-11-22 18:52:50,720 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse0 (select |c_#valid| .cse5))) (let ((.cse1 (store |c_old(#valid)| .cse5 .cse0))) (let ((.cse2 (@diff .cse1 |c_#valid|))) (let ((.cse3 (select |c_#valid| .cse2))) (and (or (= |c_#valid| |c_old(#valid)|) (= .cse0 1)) (= |c_#valid| (store .cse1 .cse2 .cse3)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse4 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_8|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| alloc_and_zero_internal_~pi~1.base 1)) (= .cse4 c_create_internal_~now~0.base) (= (store |c_old(#valid)| .cse4 (select |v_#valid_BEFORE_CALL_8| .cse4)) |v_#valid_BEFORE_CALL_8|)))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) (or (= .cse3 1) (= |c_#valid| .cse1)))))))) is different from true [2024-11-22 18:52:50,725 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse0 (select |c_#valid| .cse5))) (let ((.cse2 (store |c_old(#valid)| .cse5 .cse0))) (let ((.cse3 (@diff .cse2 |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (and (or (= |c_#valid| |c_old(#valid)|) (= .cse0 1)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse1 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_8|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse1) 1) (= (store |c_old(#valid)| .cse1 (select |v_#valid_BEFORE_CALL_8| .cse1)) |v_#valid_BEFORE_CALL_8|)))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) (= |c_#valid| (store .cse2 .cse3 .cse4)) (or (= .cse4 1) (= |c_#valid| .cse2)))))))) is different from false [2024-11-22 18:52:50,728 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse0 (select |c_#valid| .cse5))) (let ((.cse2 (store |c_old(#valid)| .cse5 .cse0))) (let ((.cse3 (@diff .cse2 |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (and (or (= |c_#valid| |c_old(#valid)|) (= .cse0 1)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse1 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_8|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse1) 1) (= (store |c_old(#valid)| .cse1 (select |v_#valid_BEFORE_CALL_8| .cse1)) |v_#valid_BEFORE_CALL_8|)))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) (= |c_#valid| (store .cse2 .cse3 .cse4)) (or (= .cse4 1) (= |c_#valid| .cse2)))))))) is different from true [2024-11-22 18:52:50,737 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and .cse0 (or (and .cse0 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| alloc_and_zero_internal_~pi~1.base 1)) (= (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_8| .cse1)) |v_#valid_BEFORE_CALL_8|) (= (select |c_#valid| .cse1) 1)))) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_create_~now~1#1.base|) 1)))))) is different from false [2024-11-22 18:52:50,739 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and .cse0 (or (and .cse0 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| alloc_and_zero_internal_~pi~1.base 1)) (= (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_8| .cse1)) |v_#valid_BEFORE_CALL_8|) (= (select |c_#valid| .cse1) 1)))) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_create_~now~1#1.base|) 1)))))) is different from true [2024-11-22 18:52:50,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:52:50,873 INFO L93 Difference]: Finished difference Result 177 states and 222 transitions. [2024-11-22 18:52:50,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-22 18:52:50,874 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 13 states have internal predecessors, (42), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 36 [2024-11-22 18:52:50,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:52:50,875 INFO L225 Difference]: With dead ends: 177 [2024-11-22 18:52:50,875 INFO L226 Difference]: Without dead ends: 177 [2024-11-22 18:52:50,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=393, Unknown=13, NotChecked=336, Total=870 [2024-11-22 18:52:50,876 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 32 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 1291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 743 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 18:52:50,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 613 Invalid, 1291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 507 Invalid, 0 Unknown, 743 Unchecked, 0.3s Time] [2024-11-22 18:52:50,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-22 18:52:50,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 168. [2024-11-22 18:52:50,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 123 states have (on average 1.4796747967479675) internal successors, (182), 149 states have internal predecessors, (182), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 15 states have call predecessors, (19), 11 states have call successors, (19) [2024-11-22 18:52:50,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 212 transitions. [2024-11-22 18:52:50,882 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 212 transitions. Word has length 36 [2024-11-22 18:52:50,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:52:50,882 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 212 transitions. [2024-11-22 18:52:50,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 13 states have internal predecessors, (42), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-22 18:52:50,882 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 212 transitions. [2024-11-22 18:52:50,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-22 18:52:50,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:52:50,883 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:52:50,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-22 18:52:51,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:52:51,087 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-22 18:52:51,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:52:51,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1166943867, now seen corresponding path program 1 times [2024-11-22 18:52:51,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:52:51,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990331912] [2024-11-22 18:52:51,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:51,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:52:51,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:51,476 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 18:52:51,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:52:51,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990331912] [2024-11-22 18:52:51,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990331912] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:52:51,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450499312] [2024-11-22 18:52:51,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:51,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:52:51,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:52:51,481 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:52:51,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-22 18:52:51,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:51,557 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-22 18:52:51,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:52:51,591 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-11-22 18:52:51,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-22 18:52:51,743 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2024-11-22 18:52:51,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:52:51,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:52:51,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2024-11-22 18:52:51,871 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-22 18:52:51,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-22 18:52:51,875 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-11-22 18:52:51,875 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:52:52,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450499312] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:52:52,041 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:52:52,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 18 [2024-11-22 18:52:52,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728659609] [2024-11-22 18:52:52,041 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:52:52,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-22 18:52:52,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:52:52,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-22 18:52:52,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=310, Unknown=1, NotChecked=36, Total=420 [2024-11-22 18:52:52,042 INFO L87 Difference]: Start difference. First operand 168 states and 212 transitions. Second operand has 19 states, 17 states have (on average 2.764705882352941) internal successors, (47), 15 states have internal predecessors, (47), 5 states have call successors, (5), 2 states have call predecessors, (5), 7 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-22 18:52:52,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:52:52,387 INFO L93 Difference]: Finished difference Result 189 states and 239 transitions. [2024-11-22 18:52:52,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 18:52:52,388 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.764705882352941) internal successors, (47), 15 states have internal predecessors, (47), 5 states have call successors, (5), 2 states have call predecessors, (5), 7 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) Word has length 36 [2024-11-22 18:52:52,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:52:52,389 INFO L225 Difference]: With dead ends: 189 [2024-11-22 18:52:52,389 INFO L226 Difference]: Without dead ends: 189 [2024-11-22 18:52:52,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=378, Unknown=1, NotChecked=40, Total=506 [2024-11-22 18:52:52,391 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 51 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 153 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 18:52:52,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 411 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 397 Invalid, 0 Unknown, 153 Unchecked, 0.3s Time] [2024-11-22 18:52:52,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-22 18:52:52,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 174. [2024-11-22 18:52:52,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 129 states have (on average 1.4806201550387597) internal successors, (191), 154 states have internal predecessors, (191), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 16 states have call predecessors, (19), 11 states have call successors, (19) [2024-11-22 18:52:52,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 221 transitions. [2024-11-22 18:52:52,396 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 221 transitions. Word has length 36 [2024-11-22 18:52:52,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:52:52,396 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 221 transitions. [2024-11-22 18:52:52,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.764705882352941) internal successors, (47), 15 states have internal predecessors, (47), 5 states have call successors, (5), 2 states have call predecessors, (5), 7 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-22 18:52:52,396 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 221 transitions. [2024-11-22 18:52:52,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-22 18:52:52,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:52:52,397 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:52:52,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-22 18:52:52,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-22 18:52:52,597 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting create_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-22 18:52:52,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:52:52,598 INFO L85 PathProgramCache]: Analyzing trace with hash -623536643, now seen corresponding path program 1 times [2024-11-22 18:52:52,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:52:52,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299141065] [2024-11-22 18:52:52,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:52,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:52:52,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:52,773 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 18:52:52,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:52:52,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299141065] [2024-11-22 18:52:52,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299141065] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:52:52,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377519780] [2024-11-22 18:52:52,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:52,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:52:52,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:52:52,776 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:52:52,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-22 18:52:52,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:52,851 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-22 18:52:52,853 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:52:52,857 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-11-22 18:52:52,866 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-11-22 18:52:52,873 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 17 treesize of output 9 [2024-11-22 18:52:52,887 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) is different from true [2024-11-22 18:52:52,907 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-22 18:52:52,908 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-11-22 18:52:52,918 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-11-22 18:52:52,918 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:52:53,018 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 18:52:53,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377519780] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:52:53,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:52:53,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 13 [2024-11-22 18:52:53,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319027455] [2024-11-22 18:52:53,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:52:53,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-22 18:52:53,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:52:53,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-22 18:52:53,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=126, Unknown=1, NotChecked=22, Total=182 [2024-11-22 18:52:53,020 INFO L87 Difference]: Start difference. First operand 174 states and 221 transitions. Second operand has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 2 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-22 18:52:53,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:52:53,327 INFO L93 Difference]: Finished difference Result 173 states and 220 transitions. [2024-11-22 18:52:53,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 18:52:53,329 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 2 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 39 [2024-11-22 18:52:53,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:52:53,331 INFO L225 Difference]: With dead ends: 173 [2024-11-22 18:52:53,331 INFO L226 Difference]: Without dead ends: 173 [2024-11-22 18:52:53,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 74 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=282, Unknown=1, NotChecked=34, Total=380 [2024-11-22 18:52:53,332 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 35 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 112 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:52:53,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 632 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 422 Invalid, 0 Unknown, 112 Unchecked, 0.2s Time] [2024-11-22 18:52:53,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-22 18:52:53,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2024-11-22 18:52:53,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 129 states have (on average 1.4728682170542635) internal successors, (190), 153 states have internal predecessors, (190), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 16 states have call predecessors, (19), 11 states have call successors, (19) [2024-11-22 18:52:53,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 220 transitions. [2024-11-22 18:52:53,339 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 220 transitions. Word has length 39 [2024-11-22 18:52:53,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:52:53,340 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 220 transitions. [2024-11-22 18:52:53,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 2 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-22 18:52:53,340 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 220 transitions. [2024-11-22 18:52:53,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-22 18:52:53,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:52:53,341 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:52:53,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-22 18:52:53,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-22 18:52:53,543 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting create_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-22 18:52:53,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:52:53,543 INFO L85 PathProgramCache]: Analyzing trace with hash -623536642, now seen corresponding path program 1 times [2024-11-22 18:52:53,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:52:53,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890783450] [2024-11-22 18:52:53,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:53,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:52:53,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:53,803 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 18:52:53,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:52:53,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890783450] [2024-11-22 18:52:53,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890783450] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:52:53,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548760211] [2024-11-22 18:52:53,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:53,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:52:53,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:52:53,806 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:52:53,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-22 18:52:53,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:53,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-22 18:52:53,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:52:53,894 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-11-22 18:52:53,933 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-11-22 18:52:53,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 18:52:53,958 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 17 treesize of output 9 [2024-11-22 18:52:53,992 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base 8) |c_#length|)) is different from true [2024-11-22 18:52:54,012 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-22 18:52:54,013 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-11-22 18:52:54,033 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-11-22 18:52:54,034 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:52:54,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548760211] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:52:54,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:52:54,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2024-11-22 18:52:54,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926580173] [2024-11-22 18:52:54,087 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:52:54,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-22 18:52:54,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:52:54,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-22 18:52:54,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=329, Unknown=1, NotChecked=36, Total=420 [2024-11-22 18:52:54,089 INFO L87 Difference]: Start difference. First operand 173 states and 220 transitions. Second operand has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 15 states have internal predecessors, (43), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-22 18:52:54,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:52:54,497 INFO L93 Difference]: Finished difference Result 172 states and 219 transitions. [2024-11-22 18:52:54,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-22 18:52:54,498 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 15 states have internal predecessors, (43), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 39 [2024-11-22 18:52:54,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:52:54,498 INFO L225 Difference]: With dead ends: 172 [2024-11-22 18:52:54,498 INFO L226 Difference]: Without dead ends: 172 [2024-11-22 18:52:54,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=475, Unknown=1, NotChecked=44, Total=600 [2024-11-22 18:52:54,499 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 14 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 18:52:54,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 928 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 664 Invalid, 0 Unknown, 113 Unchecked, 0.3s Time] [2024-11-22 18:52:54,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-22 18:52:54,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2024-11-22 18:52:54,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 129 states have (on average 1.4651162790697674) internal successors, (189), 152 states have internal predecessors, (189), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 16 states have call predecessors, (19), 11 states have call successors, (19) [2024-11-22 18:52:54,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 219 transitions. [2024-11-22 18:52:54,503 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 219 transitions. Word has length 39 [2024-11-22 18:52:54,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:52:54,503 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 219 transitions. [2024-11-22 18:52:54,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 15 states have internal predecessors, (43), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-22 18:52:54,503 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 219 transitions. [2024-11-22 18:52:54,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-22 18:52:54,504 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:52:54,504 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:52:54,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-22 18:52:54,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-22 18:52:54,705 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-22 18:52:54,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:52:54,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1067046675, now seen corresponding path program 1 times [2024-11-22 18:52:54,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:52:54,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864757273] [2024-11-22 18:52:54,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:54,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:52:54,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:55,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:52:55,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:52:55,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864757273] [2024-11-22 18:52:55,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864757273] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:52:55,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719043343] [2024-11-22 18:52:55,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:52:55,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:52:55,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:52:55,314 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:52:55,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-22 18:52:55,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:52:55,394 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 80 conjuncts are in the unsatisfiable core [2024-11-22 18:52:55,401 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:52:55,406 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-11-22 18:52:55,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 18:52:55,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 18:52:55,659 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 18:52:55,659 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-11-22 18:52:55,704 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 33 treesize of output 17 [2024-11-22 18:52:55,713 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 33 treesize of output 17 [2024-11-22 18:52:55,991 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 18:52:55,995 INFO L349 Elim1Store]: treesize reduction 29, result has 9.4 percent of original size [2024-11-22 18:52:55,995 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 31 [2024-11-22 18:52:56,003 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-22 18:52:56,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 33 treesize of output 16 [2024-11-22 18:52:56,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:52:56,010 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:52:56,809 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:52:56,809 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 1007 treesize of output 963 [2024-11-22 18:52:56,859 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:52:56,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 3079 treesize of output 2794 [2024-11-22 18:53:00,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719043343] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:53:00,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:53:00,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 36 [2024-11-22 18:53:00,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479378011] [2024-11-22 18:53:00,165 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:53:00,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-22 18:53:00,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:53:00,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-22 18:53:00,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1697, Unknown=0, NotChecked=0, Total=1806 [2024-11-22 18:53:00,166 INFO L87 Difference]: Start difference. First operand 172 states and 219 transitions. Second operand has 36 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 29 states have internal predecessors, (55), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-22 18:53:01,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:53:01,023 INFO L93 Difference]: Finished difference Result 177 states and 225 transitions. [2024-11-22 18:53:01,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-22 18:53:01,023 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 29 states have internal predecessors, (55), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 37 [2024-11-22 18:53:01,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:53:01,024 INFO L225 Difference]: With dead ends: 177 [2024-11-22 18:53:01,024 INFO L226 Difference]: Without dead ends: 177 [2024-11-22 18:53:01,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=159, Invalid=2291, Unknown=0, NotChecked=0, Total=2450 [2024-11-22 18:53:01,025 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 28 mSDsluCounter, 1787 mSDsCounter, 0 mSdLazyCounter, 1178 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 1869 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 18:53:01,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 1869 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1178 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 18:53:01,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-22 18:53:01,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 174. [2024-11-22 18:53:01,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 131 states have (on average 1.4580152671755726) internal successors, (191), 154 states have internal predecessors, (191), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 16 states have call predecessors, (19), 11 states have call successors, (19) [2024-11-22 18:53:01,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 221 transitions. [2024-11-22 18:53:01,029 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 221 transitions. Word has length 37 [2024-11-22 18:53:01,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:53:01,030 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 221 transitions. [2024-11-22 18:53:01,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 29 states have internal predecessors, (55), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-22 18:53:01,030 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 221 transitions. [2024-11-22 18:53:01,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-22 18:53:01,030 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:53:01,030 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:53:01,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-22 18:53:01,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:53:01,233 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-22 18:53:01,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:53:01,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1230657872, now seen corresponding path program 1 times [2024-11-22 18:53:01,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:53:01,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023225322] [2024-11-22 18:53:01,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:53:01,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:53:01,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:53:01,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:53:01,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:53:01,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023225322] [2024-11-22 18:53:01,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023225322] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:53:01,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630955103] [2024-11-22 18:53:01,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:53:01,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:53:01,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:53:01,727 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:53:01,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-22 18:53:01,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:53:01,800 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-22 18:53:01,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:53:01,904 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-11-22 18:53:01,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2024-11-22 18:53:01,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:53:01,987 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:53:01,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630955103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:53:01,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 18:53:01,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [17] total 29 [2024-11-22 18:53:01,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612903775] [2024-11-22 18:53:01,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:53:01,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-22 18:53:01,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:53:01,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-22 18:53:01,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=748, Unknown=0, NotChecked=0, Total=812 [2024-11-22 18:53:01,988 INFO L87 Difference]: Start difference. First operand 174 states and 221 transitions. Second operand has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 18:53:02,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:53:02,139 INFO L93 Difference]: Finished difference Result 180 states and 224 transitions. [2024-11-22 18:53:02,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-22 18:53:02,139 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2024-11-22 18:53:02,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:53:02,140 INFO L225 Difference]: With dead ends: 180 [2024-11-22 18:53:02,140 INFO L226 Difference]: Without dead ends: 180 [2024-11-22 18:53:02,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=916, Unknown=0, NotChecked=0, Total=992 [2024-11-22 18:53:02,146 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 32 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:53:02,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 941 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:53:02,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-22 18:53:02,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 175. [2024-11-22 18:53:02,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 132 states have (on average 1.446969696969697) internal successors, (191), 155 states have internal predecessors, (191), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 16 states have call predecessors, (19), 11 states have call successors, (19) [2024-11-22 18:53:02,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 221 transitions. [2024-11-22 18:53:02,151 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 221 transitions. Word has length 38 [2024-11-22 18:53:02,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:53:02,151 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 221 transitions. [2024-11-22 18:53:02,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 18:53:02,151 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 221 transitions. [2024-11-22 18:53:02,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-22 18:53:02,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:53:02,152 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:53:02,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-22 18:53:02,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:53:02,356 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-22 18:53:02,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:53:02,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1529828154, now seen corresponding path program 1 times [2024-11-22 18:53:02,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:53:02,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975009521] [2024-11-22 18:53:02,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:53:02,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:53:02,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:53:02,898 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 18:53:02,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:53:02,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975009521] [2024-11-22 18:53:02,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975009521] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:53:02,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477518629] [2024-11-22 18:53:02,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:53:02,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:53:02,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:53:02,901 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:53:02,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-22 18:53:02,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:53:02,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-11-22 18:53:02,987 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:53:02,989 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-11-22 18:53:03,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 18:53:03,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 18:53:03,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-22 18:53:03,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-22 18:53:03,181 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0) (= |c_#memory_$Pointer$#0.base| (store |c_old(#memory_$Pointer$#0.base)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.base| alloc_and_zero_internal_~pi~1.base))) (= (store |c_old(#memory_$Pointer$#0.offset)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.offset| alloc_and_zero_internal_~pi~1.base)) |c_#memory_$Pointer$#0.offset|))) is different from true [2024-11-22 18:53:03,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:53:03,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-22 18:53:03,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:53:03,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-22 18:53:03,230 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 18:53:03,230 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-11-22 18:53:03,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:53:03,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-22 18:53:03,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:53:03,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-22 18:53:03,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 18:53:03,363 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:53:03,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477518629] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:53:03,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:53:03,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 30 [2024-11-22 18:53:03,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366318435] [2024-11-22 18:53:03,589 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:53:03,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-22 18:53:03,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:53:03,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-22 18:53:03,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=847, Unknown=1, NotChecked=58, Total=992 [2024-11-22 18:53:03,591 INFO L87 Difference]: Start difference. First operand 175 states and 221 transitions. Second operand has 30 states, 28 states have (on average 2.3214285714285716) internal successors, (65), 24 states have internal predecessors, (65), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-22 18:53:04,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:53:04,155 INFO L93 Difference]: Finished difference Result 180 states and 227 transitions. [2024-11-22 18:53:04,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-22 18:53:04,156 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 2.3214285714285716) internal successors, (65), 24 states have internal predecessors, (65), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 41 [2024-11-22 18:53:04,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:53:04,156 INFO L225 Difference]: With dead ends: 180 [2024-11-22 18:53:04,156 INFO L226 Difference]: Without dead ends: 180 [2024-11-22 18:53:04,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=147, Invalid=1496, Unknown=1, NotChecked=78, Total=1722 [2024-11-22 18:53:04,157 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 11 mSDsluCounter, 1153 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 125 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 18:53:04,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1238 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 771 Invalid, 0 Unknown, 125 Unchecked, 0.4s Time] [2024-11-22 18:53:04,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-22 18:53:04,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 179. [2024-11-22 18:53:04,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 136 states have (on average 1.4338235294117647) internal successors, (195), 159 states have internal predecessors, (195), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 16 states have call predecessors, (19), 11 states have call successors, (19) [2024-11-22 18:53:04,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 225 transitions. [2024-11-22 18:53:04,165 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 225 transitions. Word has length 41 [2024-11-22 18:53:04,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:53:04,165 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 225 transitions. [2024-11-22 18:53:04,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 2.3214285714285716) internal successors, (65), 24 states have internal predecessors, (65), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-22 18:53:04,165 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 225 transitions. [2024-11-22 18:53:04,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-22 18:53:04,166 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:53:04,166 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, 1, 1, 1, 1, 1, 1] [2024-11-22 18:53:04,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-22 18:53:04,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:53:04,367 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 36 more)] === [2024-11-22 18:53:04,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:53:04,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1286010265, now seen corresponding path program 1 times [2024-11-22 18:53:04,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:53:04,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356869348] [2024-11-22 18:53:04,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:53:04,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:53:04,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:53:04,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-22 18:53:04,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:53:04,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356869348] [2024-11-22 18:53:04,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356869348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:53:04,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:53:04,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 18:53:04,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376430583] [2024-11-22 18:53:04,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:53:04,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 18:53:04,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:53:04,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 18:53:04,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:53:04,437 INFO L87 Difference]: Start difference. First operand 179 states and 225 transitions. Second operand has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 18:53:04,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:53:04,568 INFO L93 Difference]: Finished difference Result 215 states and 265 transitions. [2024-11-22 18:53:04,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 18:53:04,569 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2024-11-22 18:53:04,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:53:04,570 INFO L225 Difference]: With dead ends: 215 [2024-11-22 18:53:04,570 INFO L226 Difference]: Without dead ends: 215 [2024-11-22 18:53:04,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-22 18:53:04,570 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 42 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:53:04,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 356 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:53:04,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-22 18:53:04,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 195. [2024-11-22 18:53:04,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 153 states have (on average 1.457516339869281) internal successors, (223), 175 states have internal predecessors, (223), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 16 states have call predecessors, (19), 11 states have call successors, (19) [2024-11-22 18:53:04,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 253 transitions. [2024-11-22 18:53:04,574 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 253 transitions. Word has length 43 [2024-11-22 18:53:04,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:53:04,574 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 253 transitions. [2024-11-22 18:53:04,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 18:53:04,575 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 253 transitions. [2024-11-22 18:53:04,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-22 18:53:04,575 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:53:04,575 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, 1, 1, 1, 1, 1, 1] [2024-11-22 18:53:04,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-22 18:53:04,575 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 36 more)] === [2024-11-22 18:53:04,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:53:04,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1286010266, now seen corresponding path program 1 times [2024-11-22 18:53:04,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:53:04,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958994190] [2024-11-22 18:53:04,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:53:04,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:53:04,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:53:04,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 18:53:04,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:53:04,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958994190] [2024-11-22 18:53:04,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958994190] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:53:04,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768440639] [2024-11-22 18:53:04,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:53:04,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:53:04,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:53:04,721 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:53:04,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-22 18:53:04,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:53:04,804 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-22 18:53:04,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:53:04,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 18:53:04,873 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:53:04,942 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:53:04,942 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-11-22 18:53:04,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 18:53:04,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768440639] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:53:04,978 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:53:04,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 18 [2024-11-22 18:53:04,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403104829] [2024-11-22 18:53:04,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:53:04,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-22 18:53:04,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:53:04,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-22 18:53:04,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2024-11-22 18:53:04,979 INFO L87 Difference]: Start difference. First operand 195 states and 253 transitions. Second operand has 19 states, 18 states have (on average 4.333333333333333) internal successors, (78), 18 states have internal predecessors, (78), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-22 18:53:05,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:53:05,189 INFO L93 Difference]: Finished difference Result 233 states and 298 transitions. [2024-11-22 18:53:05,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 18:53:05,190 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.333333333333333) internal successors, (78), 18 states have internal predecessors, (78), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 43 [2024-11-22 18:53:05,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:53:05,191 INFO L225 Difference]: With dead ends: 233 [2024-11-22 18:53:05,191 INFO L226 Difference]: Without dead ends: 233 [2024-11-22 18:53:05,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2024-11-22 18:53:05,191 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 88 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:53:05,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 1027 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:53:05,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-22 18:53:05,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 219. [2024-11-22 18:53:05,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 177 states have (on average 1.4689265536723164) internal successors, (260), 199 states have internal predecessors, (260), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 16 states have call predecessors, (19), 11 states have call successors, (19) [2024-11-22 18:53:05,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 290 transitions. [2024-11-22 18:53:05,196 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 290 transitions. Word has length 43 [2024-11-22 18:53:05,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:53:05,197 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 290 transitions. [2024-11-22 18:53:05,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.333333333333333) internal successors, (78), 18 states have internal predecessors, (78), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-22 18:53:05,197 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 290 transitions. [2024-11-22 18:53:05,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-22 18:53:05,197 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:53:05,197 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:53:05,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-22 18:53:05,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-22 18:53:05,398 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-22 18:53:05,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:53:05,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1211611979, now seen corresponding path program 1 times [2024-11-22 18:53:05,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:53:05,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878789416] [2024-11-22 18:53:05,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:53:05,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:53:05,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:53:05,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-22 18:53:05,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:53:05,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878789416] [2024-11-22 18:53:05,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878789416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:53:05,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:53:05,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 18:53:05,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767066274] [2024-11-22 18:53:05,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:53:05,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 18:53:05,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:53:05,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 18:53:05,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-22 18:53:05,468 INFO L87 Difference]: Start difference. First operand 219 states and 290 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 18:53:05,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:53:05,520 INFO L93 Difference]: Finished difference Result 228 states and 295 transitions. [2024-11-22 18:53:05,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 18:53:05,520 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 44 [2024-11-22 18:53:05,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:53:05,521 INFO L225 Difference]: With dead ends: 228 [2024-11-22 18:53:05,522 INFO L226 Difference]: Without dead ends: 228 [2024-11-22 18:53:05,522 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-11-22 18:53:05,522 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 42 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:53:05,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 668 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:53:05,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-22 18:53:05,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 219. [2024-11-22 18:53:05,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 177 states have (on average 1.4576271186440677) internal successors, (258), 199 states have internal predecessors, (258), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 16 states have call predecessors, (19), 11 states have call successors, (19) [2024-11-22 18:53:05,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 288 transitions. [2024-11-22 18:53:05,528 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 288 transitions. Word has length 44 [2024-11-22 18:53:05,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:53:05,528 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 288 transitions. [2024-11-22 18:53:05,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 18:53:05,529 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 288 transitions. [2024-11-22 18:53:05,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-22 18:53:05,529 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:53:05,529 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:53:05,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-22 18:53:05,529 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-22 18:53:05,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:53:05,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1795330222, now seen corresponding path program 1 times [2024-11-22 18:53:05,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:53:05,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804679973] [2024-11-22 18:53:05,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:53:05,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:53:05,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:53:05,668 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-22 18:53:05,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:53:05,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804679973] [2024-11-22 18:53:05,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804679973] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:53:05,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:53:05,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-22 18:53:05,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972053649] [2024-11-22 18:53:05,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:53:05,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-22 18:53:05,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:53:05,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-22 18:53:05,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-22 18:53:05,670 INFO L87 Difference]: Start difference. First operand 219 states and 288 transitions. Second operand has 11 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-22 18:53:05,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:53:05,843 INFO L93 Difference]: Finished difference Result 219 states and 285 transitions. [2024-11-22 18:53:05,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 18:53:05,843 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 51 [2024-11-22 18:53:05,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:53:05,844 INFO L225 Difference]: With dead ends: 219 [2024-11-22 18:53:05,844 INFO L226 Difference]: Without dead ends: 219 [2024-11-22 18:53:05,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-22 18:53:05,845 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 8 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:53:05,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 472 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:53:05,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-22 18:53:05,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2024-11-22 18:53:05,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 177 states have (on average 1.4406779661016949) internal successors, (255), 199 states have internal predecessors, (255), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 16 states have call predecessors, (19), 11 states have call successors, (19) [2024-11-22 18:53:05,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 285 transitions. [2024-11-22 18:53:05,850 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 285 transitions. Word has length 51 [2024-11-22 18:53:05,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:53:05,850 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 285 transitions. [2024-11-22 18:53:05,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-22 18:53:05,851 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 285 transitions. [2024-11-22 18:53:05,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-22 18:53:05,851 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:53:05,851 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:53:05,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-22 18:53:05,851 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-22 18:53:05,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:53:05,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1795330223, now seen corresponding path program 1 times [2024-11-22 18:53:05,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:53:05,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351008032] [2024-11-22 18:53:05,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:53:05,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:53:05,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:53:06,116 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 18:53:06,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:53:06,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351008032] [2024-11-22 18:53:06,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351008032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:53:06,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:53:06,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-22 18:53:06,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629691268] [2024-11-22 18:53:06,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:53:06,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-22 18:53:06,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:53:06,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-22 18:53:06,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-22 18:53:06,117 INFO L87 Difference]: Start difference. First operand 219 states and 285 transitions. Second operand has 12 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-22 18:53:06,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:53:06,340 INFO L93 Difference]: Finished difference Result 219 states and 282 transitions. [2024-11-22 18:53:06,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 18:53:06,340 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 51 [2024-11-22 18:53:06,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:53:06,341 INFO L225 Difference]: With dead ends: 219 [2024-11-22 18:53:06,341 INFO L226 Difference]: Without dead ends: 219 [2024-11-22 18:53:06,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-22 18:53:06,342 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 8 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:53:06,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 423 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:53:06,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-22 18:53:06,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2024-11-22 18:53:06,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 177 states have (on average 1.423728813559322) internal successors, (252), 199 states have internal predecessors, (252), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 16 states have call predecessors, (19), 11 states have call successors, (19) [2024-11-22 18:53:06,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 282 transitions. [2024-11-22 18:53:06,350 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 282 transitions. Word has length 51 [2024-11-22 18:53:06,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:53:06,350 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 282 transitions. [2024-11-22 18:53:06,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-22 18:53:06,350 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 282 transitions. [2024-11-22 18:53:06,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-22 18:53:06,350 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:53:06,350 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:53:06,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-22 18:53:06,351 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-22 18:53:06,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:53:06,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1267776755, now seen corresponding path program 1 times [2024-11-22 18:53:06,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:53:06,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069730311] [2024-11-22 18:53:06,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:53:06,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:53:06,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:53:06,571 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-22 18:53:06,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:53:06,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069730311] [2024-11-22 18:53:06,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069730311] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:53:06,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555912217] [2024-11-22 18:53:06,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:53:06,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:53:06,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:53:06,573 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:53:06,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-22 18:53:06,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:53:06,659 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-22 18:53:06,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:53:06,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-22 18:53:06,737 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 21 treesize of output 9 [2024-11-22 18:53:06,739 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-22 18:53:06,739 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:53:06,750 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 34 treesize of output 28 [2024-11-22 18:53:06,801 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-22 18:53:06,801 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 12 treesize of output 11 [2024-11-22 18:53:06,812 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-22 18:53:06,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555912217] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:53:06,812 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:53:06,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 21 [2024-11-22 18:53:06,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593588284] [2024-11-22 18:53:06,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:53:06,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-22 18:53:06,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:53:06,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-22 18:53:06,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2024-11-22 18:53:06,814 INFO L87 Difference]: Start difference. First operand 219 states and 282 transitions. Second operand has 22 states, 19 states have (on average 2.736842105263158) internal successors, (52), 18 states have internal predecessors, (52), 4 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-22 18:53:07,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:53:07,122 INFO L93 Difference]: Finished difference Result 237 states and 302 transitions. [2024-11-22 18:53:07,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-22 18:53:07,123 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 2.736842105263158) internal successors, (52), 18 states have internal predecessors, (52), 4 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) Word has length 46 [2024-11-22 18:53:07,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:53:07,124 INFO L225 Difference]: With dead ends: 237 [2024-11-22 18:53:07,124 INFO L226 Difference]: Without dead ends: 237 [2024-11-22 18:53:07,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2024-11-22 18:53:07,124 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 39 mSDsluCounter, 1263 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 1364 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 18:53:07,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 1364 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 18:53:07,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-22 18:53:07,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 226. [2024-11-22 18:53:07,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 184 states have (on average 1.4130434782608696) internal successors, (260), 206 states have internal predecessors, (260), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 16 states have call predecessors, (19), 11 states have call successors, (19) [2024-11-22 18:53:07,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 290 transitions. [2024-11-22 18:53:07,131 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 290 transitions. Word has length 46 [2024-11-22 18:53:07,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:53:07,131 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 290 transitions. [2024-11-22 18:53:07,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 2.736842105263158) internal successors, (52), 18 states have internal predecessors, (52), 4 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-22 18:53:07,131 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 290 transitions. [2024-11-22 18:53:07,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-22 18:53:07,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:53:07,131 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:53:07,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-22 18:53:07,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-22 18:53:07,332 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-22 18:53:07,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:53:07,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1267776754, now seen corresponding path program 1 times [2024-11-22 18:53:07,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:53:07,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964623947] [2024-11-22 18:53:07,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:53:07,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:53:07,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:53:07,861 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:53:07,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:53:07,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964623947] [2024-11-22 18:53:07,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964623947] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:53:07,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909734886] [2024-11-22 18:53:07,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:53:07,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:53:07,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:53:07,862 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:53:07,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-22 18:53:07,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:53:07,953 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-22 18:53:07,957 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:53:08,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-22 18:53:08,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-22 18:53:08,244 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 21 treesize of output 9 [2024-11-22 18:53:08,293 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 18:53:08,293 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:53:08,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2024-11-22 18:53:08,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:53:08,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:53:08,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:53:08,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:53:08,584 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:53:08,584 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-11-22 18:53:08,695 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 18:53:08,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909734886] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:53:08,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:53:08,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 14, 14] total 48 [2024-11-22 18:53:08,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948703240] [2024-11-22 18:53:08,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:53:08,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-22 18:53:08,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:53:08,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-22 18:53:08,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=2205, Unknown=0, NotChecked=0, Total=2352 [2024-11-22 18:53:08,697 INFO L87 Difference]: Start difference. First operand 226 states and 290 transitions. Second operand has 49 states, 46 states have (on average 2.1739130434782608) internal successors, (100), 41 states have internal predecessors, (100), 6 states have call successors, (7), 2 states have call predecessors, (7), 9 states have return successors, (11), 11 states have call predecessors, (11), 6 states have call successors, (11) [2024-11-22 18:53:09,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:53:09,536 INFO L93 Difference]: Finished difference Result 236 states and 299 transitions. [2024-11-22 18:53:09,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-22 18:53:09,537 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 46 states have (on average 2.1739130434782608) internal successors, (100), 41 states have internal predecessors, (100), 6 states have call successors, (7), 2 states have call predecessors, (7), 9 states have return successors, (11), 11 states have call predecessors, (11), 6 states have call successors, (11) Word has length 46 [2024-11-22 18:53:09,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:53:09,538 INFO L225 Difference]: With dead ends: 236 [2024-11-22 18:53:09,538 INFO L226 Difference]: Without dead ends: 236 [2024-11-22 18:53:09,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=235, Invalid=3425, Unknown=0, NotChecked=0, Total=3660 [2024-11-22 18:53:09,539 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 64 mSDsluCounter, 1746 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1816 SdHoareTripleChecker+Invalid, 1419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 18:53:09,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 1816 Invalid, 1419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1398 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 18:53:09,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-22 18:53:09,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 226. [2024-11-22 18:53:09,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 184 states have (on average 1.4076086956521738) internal successors, (259), 206 states have internal predecessors, (259), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 16 states have call predecessors, (19), 11 states have call successors, (19) [2024-11-22 18:53:09,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 289 transitions. [2024-11-22 18:53:09,544 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 289 transitions. Word has length 46 [2024-11-22 18:53:09,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:53:09,544 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 289 transitions. [2024-11-22 18:53:09,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 46 states have (on average 2.1739130434782608) internal successors, (100), 41 states have internal predecessors, (100), 6 states have call successors, (7), 2 states have call predecessors, (7), 9 states have return successors, (11), 11 states have call predecessors, (11), 6 states have call successors, (11) [2024-11-22 18:53:09,545 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 289 transitions. [2024-11-22 18:53:09,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-22 18:53:09,545 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:53:09,545 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2024-11-22 18:53:09,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-22 18:53:09,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-22 18:53:09,746 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-22 18:53:09,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:53:09,746 INFO L85 PathProgramCache]: Analyzing trace with hash -665102322, now seen corresponding path program 2 times [2024-11-22 18:53:09,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:53:09,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930623030] [2024-11-22 18:53:09,746 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 18:53:09,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:53:09,758 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 18:53:09,758 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:53:10,468 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-22 18:53:10,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:53:10,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930623030] [2024-11-22 18:53:10,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930623030] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:53:10,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233229950] [2024-11-22 18:53:10,468 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 18:53:10,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:53:10,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:53:10,469 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:53:10,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-22 18:53:10,568 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 18:53:10,569 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:53:10,571 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-22 18:53:10,573 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:53:10,575 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-11-22 18:53:10,650 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) is different from true [2024-11-22 18:53:10,661 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_32|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| alloc_and_zero_internal_~pi~1.base 1)) (= .cse0 c_create_internal_~now~0.base) (= |v_#valid_BEFORE_CALL_32| (store |c_old(#valid)| .cse0 (select |v_#valid_BEFORE_CALL_32| .cse0)))))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) is different from false [2024-11-22 18:53:10,662 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_32|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| alloc_and_zero_internal_~pi~1.base 1)) (= .cse0 c_create_internal_~now~0.base) (= |v_#valid_BEFORE_CALL_32| (store |c_old(#valid)| .cse0 (select |v_#valid_BEFORE_CALL_32| .cse0)))))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) is different from true [2024-11-22 18:53:10,673 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_32|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse0) 1) (= |v_#valid_BEFORE_CALL_32| (store |c_old(#valid)| .cse0 (select |v_#valid_BEFORE_CALL_32| .cse0)))))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) is different from false [2024-11-22 18:53:10,674 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse0 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_32|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse0) 1) (= |v_#valid_BEFORE_CALL_32| (store |c_old(#valid)| .cse0 (select |v_#valid_BEFORE_CALL_32| .cse0)))))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) is different from true [2024-11-22 18:53:10,736 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (create_internal_~now~0.base Int) (v_alloc_and_zero_internal_~pi~1.base_116 Int)) (let ((.cse0 (store |c_old(#valid)| v_alloc_and_zero_internal_~pi~1.base_116 1))) (and (= (select .cse0 create_internal_~now~0.base) 1) (= |c_#valid| (store .cse0 alloc_and_zero_internal_~pi~1.base 1))))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (v_alloc_and_zero_internal_~pi~1.base_115 Int)) (let ((.cse1 (store |v_#valid_BEFORE_CALL_32| v_alloc_and_zero_internal_~pi~1.base_115 1)) (.cse2 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_32|))) (and (= (select .cse1 .cse2) 1) (= |c_#valid| (store .cse1 alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_32| (store |c_old(#valid)| .cse2 (select |v_#valid_BEFORE_CALL_32| .cse2))))))) is different from false [2024-11-22 18:53:10,738 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (create_internal_~now~0.base Int) (v_alloc_and_zero_internal_~pi~1.base_116 Int)) (let ((.cse0 (store |c_old(#valid)| v_alloc_and_zero_internal_~pi~1.base_116 1))) (and (= (select .cse0 create_internal_~now~0.base) 1) (= |c_#valid| (store .cse0 alloc_and_zero_internal_~pi~1.base 1))))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (v_alloc_and_zero_internal_~pi~1.base_115 Int)) (let ((.cse1 (store |v_#valid_BEFORE_CALL_32| v_alloc_and_zero_internal_~pi~1.base_115 1)) (.cse2 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_32|))) (and (= (select .cse1 .cse2) 1) (= |c_#valid| (store .cse1 alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_32| (store |c_old(#valid)| .cse2 (select |v_#valid_BEFORE_CALL_32| .cse2))))))) is different from true [2024-11-22 18:53:10,857 INFO L349 Elim1Store]: treesize reduction 70, result has 28.6 percent of original size [2024-11-22 18:53:10,857 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 4 case distinctions, treesize of input 29 treesize of output 48 [2024-11-22 18:53:10,873 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (v_alloc_and_zero_internal_~pi~1.base_115 Int)) (let ((.cse0 (store |v_#valid_BEFORE_CALL_32| v_alloc_and_zero_internal_~pi~1.base_115 1)) (.cse1 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_32|))) (and (= |c_#valid| (store .cse0 alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_32| (store |v_old(#valid)_AFTER_CALL_50| .cse1 (select |v_#valid_BEFORE_CALL_32| .cse1))) (= (select .cse0 .cse1) 1)))) (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((v_alloc_and_zero_internal_~pi~1.base_116 Int)) (= (select |c_#valid| v_alloc_and_zero_internal_~pi~1.base_116) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1)))) is different from false [2024-11-22 18:53:10,875 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (v_alloc_and_zero_internal_~pi~1.base_115 Int)) (let ((.cse0 (store |v_#valid_BEFORE_CALL_32| v_alloc_and_zero_internal_~pi~1.base_115 1)) (.cse1 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_32|))) (and (= |c_#valid| (store .cse0 alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_32| (store |v_old(#valid)_AFTER_CALL_50| .cse1 (select |v_#valid_BEFORE_CALL_32| .cse1))) (= (select .cse0 .cse1) 1)))) (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((v_alloc_and_zero_internal_~pi~1.base_116 Int)) (= (select |c_#valid| v_alloc_and_zero_internal_~pi~1.base_116) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1)))) is different from true [2024-11-22 18:53:10,876 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 19 not checked. [2024-11-22 18:53:10,876 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:53:11,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233229950] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:53:11,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:53:11,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 26 [2024-11-22 18:53:11,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100887584] [2024-11-22 18:53:11,041 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:53:11,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-22 18:53:11,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:53:11,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-22 18:53:11,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=421, Unknown=9, NotChecked=230, Total=756 [2024-11-22 18:53:11,042 INFO L87 Difference]: Start difference. First operand 226 states and 289 transitions. Second operand has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 20 states have internal predecessors, (61), 7 states have call successors, (7), 2 states have call predecessors, (7), 7 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-22 18:53:11,386 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse8 (select |c_#valid| .cse2))) (let ((.cse14 (store |c_old(#valid)| .cse2 .cse8))) (let ((.cse4 (@diff .cse14 |c_#valid|))) (let ((.cse9 (select |c_#valid| .cse4))) (let ((.cse13 (store .cse14 .cse4 .cse9))) (let ((.cse11 (@diff .cse13 |c_#valid|))) (let ((.cse10 (select |c_#valid| .cse11)) (.cse3 (select (select |c_#memory_$Pointer$#0.base| c_create_internal_~now~0.base) c_create_internal_~now~0.offset)) (.cse5 (= (select |c_old(#valid)| .cse4) 0)) (.cse6 (= |c_#valid| .cse14)) (.cse12 (= |c_#valid| .cse13)) (.cse0 (= |c_#valid| |c_old(#valid)|)) (.cse1 (= (select |c_old(#valid)| .cse2) 0))) (and (or .cse0 .cse1 (= .cse2 .cse3)) (or .cse0 .cse1 (= |c_create_internal_#t~mem8.base| .cse2)) (or .cse0 (= .cse2 |c_create_internal_#t~ret7.base|) .cse1) (or (= .cse4 |c_create_internal_#t~mem8.base|) .cse5 .cse6) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse7 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_32|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| alloc_and_zero_internal_~pi~1.base 1)) (= .cse7 c_create_internal_~now~0.base) (= |v_#valid_BEFORE_CALL_32| (store |c_old(#valid)| .cse7 (select |v_#valid_BEFORE_CALL_32| .cse7)))))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) (or .cse0 .cse1 (= .cse8 1)) (or (= .cse9 1) .cse5 .cse6) (or (= .cse10 1) (= (select |c_old(#valid)| .cse11) 0) .cse12) (or (= .cse4 |c_create_internal_#t~ret7.base|) .cse5 .cse6) (= |c_#valid| (store .cse13 .cse11 .cse10)) (or (= .cse4 c_create_internal_~now~0.base) .cse5 .cse6) (or (= .cse4 .cse3) .cse5 .cse6) .cse12 (or .cse0 .cse1 (= c_create_internal_~now~0.base .cse2))))))))))) is different from false [2024-11-22 18:53:11,389 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse8 (select |c_#valid| .cse2))) (let ((.cse14 (store |c_old(#valid)| .cse2 .cse8))) (let ((.cse4 (@diff .cse14 |c_#valid|))) (let ((.cse9 (select |c_#valid| .cse4))) (let ((.cse13 (store .cse14 .cse4 .cse9))) (let ((.cse11 (@diff .cse13 |c_#valid|))) (let ((.cse10 (select |c_#valid| .cse11)) (.cse3 (select (select |c_#memory_$Pointer$#0.base| c_create_internal_~now~0.base) c_create_internal_~now~0.offset)) (.cse5 (= (select |c_old(#valid)| .cse4) 0)) (.cse6 (= |c_#valid| .cse14)) (.cse12 (= |c_#valid| .cse13)) (.cse0 (= |c_#valid| |c_old(#valid)|)) (.cse1 (= (select |c_old(#valid)| .cse2) 0))) (and (or .cse0 .cse1 (= .cse2 .cse3)) (or .cse0 .cse1 (= |c_create_internal_#t~mem8.base| .cse2)) (or .cse0 (= .cse2 |c_create_internal_#t~ret7.base|) .cse1) (or (= .cse4 |c_create_internal_#t~mem8.base|) .cse5 .cse6) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse7 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_32|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| alloc_and_zero_internal_~pi~1.base 1)) (= .cse7 c_create_internal_~now~0.base) (= |v_#valid_BEFORE_CALL_32| (store |c_old(#valid)| .cse7 (select |v_#valid_BEFORE_CALL_32| .cse7)))))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) (or .cse0 .cse1 (= .cse8 1)) (or (= .cse9 1) .cse5 .cse6) (or (= .cse10 1) (= (select |c_old(#valid)| .cse11) 0) .cse12) (or (= .cse4 |c_create_internal_#t~ret7.base|) .cse5 .cse6) (= |c_#valid| (store .cse13 .cse11 .cse10)) (or (= .cse4 c_create_internal_~now~0.base) .cse5 .cse6) (or (= .cse4 .cse3) .cse5 .cse6) .cse12 (or .cse0 .cse1 (= c_create_internal_~now~0.base .cse2))))))))))) is different from true [2024-11-22 18:53:11,396 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse2))) (let ((.cse14 (store |c_old(#valid)| .cse2 .cse4))) (let ((.cse12 (@diff .cse14 |c_#valid|))) (let ((.cse5 (select |c_#valid| .cse12))) (let ((.cse11 (store .cse14 .cse12 .cse5))) (let ((.cse9 (@diff .cse11 |c_#valid|))) (let ((.cse0 (= |c_#valid| |c_old(#valid)|)) (.cse1 (= (select |c_old(#valid)| .cse2) 0)) (.cse8 (select |c_#valid| .cse9)) (.cse3 (select (select |c_#memory_$Pointer$#0.base| c_create_internal_~now~0.base) c_create_internal_~now~0.offset)) (.cse6 (= (select |c_old(#valid)| .cse12) 0)) (.cse7 (= |c_#valid| .cse14)) (.cse10 (= |c_#valid| .cse11))) (and (or .cse0 .cse1 (= .cse2 .cse3)) (or .cse0 .cse1 (= .cse4 1)) (or (= .cse5 1) .cse6 .cse7) (or (= .cse8 1) (= (select |c_old(#valid)| .cse9) 0) .cse10) (= |c_#valid| (store .cse11 .cse9 .cse8)) (or (= .cse12 .cse3) .cse6 .cse7) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse13 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_32|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse13) 1) (= |v_#valid_BEFORE_CALL_32| (store |c_old(#valid)| .cse13 (select |v_#valid_BEFORE_CALL_32| .cse13)))))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) .cse10))))))))) is different from false [2024-11-22 18:53:11,399 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse2))) (let ((.cse14 (store |c_old(#valid)| .cse2 .cse4))) (let ((.cse12 (@diff .cse14 |c_#valid|))) (let ((.cse5 (select |c_#valid| .cse12))) (let ((.cse11 (store .cse14 .cse12 .cse5))) (let ((.cse9 (@diff .cse11 |c_#valid|))) (let ((.cse0 (= |c_#valid| |c_old(#valid)|)) (.cse1 (= (select |c_old(#valid)| .cse2) 0)) (.cse8 (select |c_#valid| .cse9)) (.cse3 (select (select |c_#memory_$Pointer$#0.base| c_create_internal_~now~0.base) c_create_internal_~now~0.offset)) (.cse6 (= (select |c_old(#valid)| .cse12) 0)) (.cse7 (= |c_#valid| .cse14)) (.cse10 (= |c_#valid| .cse11))) (and (or .cse0 .cse1 (= .cse2 .cse3)) (or .cse0 .cse1 (= .cse4 1)) (or (= .cse5 1) .cse6 .cse7) (or (= .cse8 1) (= (select |c_old(#valid)| .cse9) 0) .cse10) (= |c_#valid| (store .cse11 .cse9 .cse8)) (or (= .cse12 .cse3) .cse6 .cse7) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse13 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_32|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse13) 1) (= |v_#valid_BEFORE_CALL_32| (store |c_old(#valid)| .cse13 (select |v_#valid_BEFORE_CALL_32| .cse13)))))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) .cse10))))))))) is different from true [2024-11-22 18:53:11,404 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse6 (select |c_#valid| .cse2))) (let ((.cse13 (store |c_old(#valid)| .cse2 .cse6))) (let ((.cse3 (@diff .cse13 |c_#valid|))) (let ((.cse7 (select |c_#valid| .cse3))) (let ((.cse11 (store .cse13 .cse3 .cse7))) (let ((.cse9 (@diff .cse11 |c_#valid|))) (let ((.cse0 (= |c_#valid| |c_old(#valid)|)) (.cse1 (= (select |c_old(#valid)| .cse2) 0)) (.cse4 (= (select |c_old(#valid)| .cse3) 0)) (.cse5 (= |c_#valid| .cse13)) (.cse8 (select |c_#valid| .cse9)) (.cse10 (= |c_#valid| .cse11))) (and (or .cse0 .cse1 (= |c_create_internal_#t~mem8.base| .cse2)) (or (= .cse3 |c_create_internal_#t~mem8.base|) .cse4 .cse5) (or .cse0 .cse1 (= .cse6 1)) (or (= .cse7 1) .cse4 .cse5) (or (= .cse8 1) (= (select |c_old(#valid)| .cse9) 0) .cse10) (= |c_#valid| (store .cse11 .cse9 .cse8)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse12 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_32|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse12) 1) (= |v_#valid_BEFORE_CALL_32| (store |c_old(#valid)| .cse12 (select |v_#valid_BEFORE_CALL_32| .cse12)))))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) .cse10))))))))) is different from false [2024-11-22 18:53:11,406 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse6 (select |c_#valid| .cse2))) (let ((.cse13 (store |c_old(#valid)| .cse2 .cse6))) (let ((.cse3 (@diff .cse13 |c_#valid|))) (let ((.cse7 (select |c_#valid| .cse3))) (let ((.cse11 (store .cse13 .cse3 .cse7))) (let ((.cse9 (@diff .cse11 |c_#valid|))) (let ((.cse0 (= |c_#valid| |c_old(#valid)|)) (.cse1 (= (select |c_old(#valid)| .cse2) 0)) (.cse4 (= (select |c_old(#valid)| .cse3) 0)) (.cse5 (= |c_#valid| .cse13)) (.cse8 (select |c_#valid| .cse9)) (.cse10 (= |c_#valid| .cse11))) (and (or .cse0 .cse1 (= |c_create_internal_#t~mem8.base| .cse2)) (or (= .cse3 |c_create_internal_#t~mem8.base|) .cse4 .cse5) (or .cse0 .cse1 (= .cse6 1)) (or (= .cse7 1) .cse4 .cse5) (or (= .cse8 1) (= (select |c_old(#valid)| .cse9) 0) .cse10) (= |c_#valid| (store .cse11 .cse9 .cse8)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse12 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_32|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse12) 1) (= |v_#valid_BEFORE_CALL_32| (store |c_old(#valid)| .cse12 (select |v_#valid_BEFORE_CALL_32| .cse12)))))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) .cse10))))))))) is different from true [2024-11-22 18:53:11,410 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse2 (select |c_#valid| .cse12))) (let ((.cse13 (store |c_old(#valid)| .cse12 .cse2))) (let ((.cse10 (@diff .cse13 |c_#valid|))) (let ((.cse3 (select |c_#valid| .cse10))) (let ((.cse9 (store .cse13 .cse10 .cse3))) (let ((.cse7 (@diff .cse9 |c_#valid|))) (let ((.cse6 (select |c_#valid| .cse7)) (.cse4 (= (select |c_old(#valid)| .cse10) 0)) (.cse5 (= |c_#valid| .cse13)) (.cse8 (= |c_#valid| .cse9)) (.cse0 (= |c_#valid| |c_old(#valid)|)) (.cse1 (= (select |c_old(#valid)| .cse12) 0))) (and (or .cse0 .cse1 (= .cse2 1)) (or (= .cse3 1) .cse4 .cse5) (or (= .cse6 1) (= (select |c_old(#valid)| .cse7) 0) .cse8) (= |c_#valid| (store .cse9 .cse7 .cse6)) (or (= .cse10 c_create_internal_~now~0.base) .cse4 .cse5) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse11 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_32|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse11) 1) (= |v_#valid_BEFORE_CALL_32| (store |c_old(#valid)| .cse11 (select |v_#valid_BEFORE_CALL_32| .cse11)))))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) .cse8 (or .cse0 .cse1 (= c_create_internal_~now~0.base .cse12))))))))))) is different from false [2024-11-22 18:53:11,412 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse12 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse2 (select |c_#valid| .cse12))) (let ((.cse13 (store |c_old(#valid)| .cse12 .cse2))) (let ((.cse10 (@diff .cse13 |c_#valid|))) (let ((.cse3 (select |c_#valid| .cse10))) (let ((.cse9 (store .cse13 .cse10 .cse3))) (let ((.cse7 (@diff .cse9 |c_#valid|))) (let ((.cse6 (select |c_#valid| .cse7)) (.cse4 (= (select |c_old(#valid)| .cse10) 0)) (.cse5 (= |c_#valid| .cse13)) (.cse8 (= |c_#valid| .cse9)) (.cse0 (= |c_#valid| |c_old(#valid)|)) (.cse1 (= (select |c_old(#valid)| .cse12) 0))) (and (or .cse0 .cse1 (= .cse2 1)) (or (= .cse3 1) .cse4 .cse5) (or (= .cse6 1) (= (select |c_old(#valid)| .cse7) 0) .cse8) (= |c_#valid| (store .cse9 .cse7 .cse6)) (or (= .cse10 c_create_internal_~now~0.base) .cse4 .cse5) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse11 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_32|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse11) 1) (= |v_#valid_BEFORE_CALL_32| (store |c_old(#valid)| .cse11 (select |v_#valid_BEFORE_CALL_32| .cse11)))))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) .cse8 (or .cse0 .cse1 (= c_create_internal_~now~0.base .cse12))))))))))) is different from true [2024-11-22 18:53:11,415 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse1 (store |c_old(#valid)| .cse3 (select |c_#valid| .cse3)))) (let ((.cse0 (@diff .cse1 |c_#valid|))) (and (or (= .cse0 c_create_internal_~now~0.base) (= (select |c_old(#valid)| .cse0) 0) (= |c_#valid| .cse1)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse2 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_32|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse2) 1) (= |v_#valid_BEFORE_CALL_32| (store |c_old(#valid)| .cse2 (select |v_#valid_BEFORE_CALL_32| .cse2)))))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) (= |c_#valid| (store .cse1 .cse0 (select |c_#valid| .cse0))) (or (= |c_#valid| |c_old(#valid)|) (= (select |c_old(#valid)| .cse3) 0) (= c_create_internal_~now~0.base .cse3)))))) is different from false [2024-11-22 18:53:11,421 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse1 (store |c_old(#valid)| .cse3 (select |c_#valid| .cse3)))) (let ((.cse0 (@diff .cse1 |c_#valid|))) (and (or (= .cse0 c_create_internal_~now~0.base) (= (select |c_old(#valid)| .cse0) 0) (= |c_#valid| .cse1)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_32| (Array Int Int))) (let ((.cse2 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_32|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_32| alloc_and_zero_internal_~pi~1.base 1)) (= (select |c_#valid| .cse2) 1) (= |v_#valid_BEFORE_CALL_32| (store |c_old(#valid)| .cse2 (select |v_#valid_BEFORE_CALL_32| .cse2)))))) (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))))) (= |c_#valid| (store .cse1 .cse0 (select |c_#valid| .cse0))) (or (= |c_#valid| |c_old(#valid)|) (= (select |c_old(#valid)| .cse3) 0) (= c_create_internal_~now~0.base .cse3)))))) is different from true [2024-11-22 18:53:11,488 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse7 (select |c_#valid| .cse6))) (let ((.cse10 (store |c_old(#valid)| .cse6 .cse7))) (let ((.cse9 (@diff .cse10 |c_#valid|))) (let ((.cse8 (select |c_#valid| .cse9))) (let ((.cse5 (store .cse10 .cse9 .cse8))) (let ((.cse4 (@diff .cse5 |c_#valid|))) (let ((.cse3 (select |c_#valid| .cse4))) (and (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (create_internal_~now~0.base Int) (v_alloc_and_zero_internal_~pi~1.base_116 Int)) (let ((.cse0 (store |c_old(#valid)| v_alloc_and_zero_internal_~pi~1.base_116 1))) (and (= (select .cse0 create_internal_~now~0.base) 1) (= |c_#valid| (store .cse0 alloc_and_zero_internal_~pi~1.base 1))))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (v_alloc_and_zero_internal_~pi~1.base_115 Int)) (let ((.cse1 (store |v_#valid_BEFORE_CALL_32| v_alloc_and_zero_internal_~pi~1.base_115 1)) (.cse2 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_32|))) (and (= (select .cse1 .cse2) 1) (= |c_#valid| (store .cse1 alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_32| (store |c_old(#valid)| .cse2 (select |v_#valid_BEFORE_CALL_32| .cse2))))))) (or (= .cse3 1) (= (select |c_old(#valid)| .cse4) 0) (= .cse4 c_create_internal_~now~0.base) (= |c_#valid| .cse5)) (or (= |c_#valid| |c_old(#valid)|) (= (select |c_old(#valid)| .cse6) 0) (= .cse7 1) (= c_create_internal_~now~0.base .cse6)) (= |c_#valid| (store .cse5 .cse4 .cse3)) (or (= .cse8 1) (= .cse9 c_create_internal_~now~0.base) (= (select |c_old(#valid)| .cse9) 0) (= |c_#valid| .cse10))))))))))) is different from false [2024-11-22 18:53:11,493 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse7 (select |c_#valid| .cse6))) (let ((.cse10 (store |c_old(#valid)| .cse6 .cse7))) (let ((.cse9 (@diff .cse10 |c_#valid|))) (let ((.cse8 (select |c_#valid| .cse9))) (let ((.cse5 (store .cse10 .cse9 .cse8))) (let ((.cse4 (@diff .cse5 |c_#valid|))) (let ((.cse3 (select |c_#valid| .cse4))) (and (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (create_internal_~now~0.base Int) (v_alloc_and_zero_internal_~pi~1.base_116 Int)) (let ((.cse0 (store |c_old(#valid)| v_alloc_and_zero_internal_~pi~1.base_116 1))) (and (= (select .cse0 create_internal_~now~0.base) 1) (= |c_#valid| (store .cse0 alloc_and_zero_internal_~pi~1.base 1))))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (v_alloc_and_zero_internal_~pi~1.base_115 Int)) (let ((.cse1 (store |v_#valid_BEFORE_CALL_32| v_alloc_and_zero_internal_~pi~1.base_115 1)) (.cse2 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_32|))) (and (= (select .cse1 .cse2) 1) (= |c_#valid| (store .cse1 alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_32| (store |c_old(#valid)| .cse2 (select |v_#valid_BEFORE_CALL_32| .cse2))))))) (or (= .cse3 1) (= (select |c_old(#valid)| .cse4) 0) (= .cse4 c_create_internal_~now~0.base) (= |c_#valid| .cse5)) (or (= |c_#valid| |c_old(#valid)|) (= (select |c_old(#valid)| .cse6) 0) (= .cse7 1) (= c_create_internal_~now~0.base .cse6)) (= |c_#valid| (store .cse5 .cse4 .cse3)) (or (= .cse8 1) (= .cse9 c_create_internal_~now~0.base) (= (select |c_old(#valid)| .cse9) 0) (= |c_#valid| .cse10))))))))))) is different from true [2024-11-22 18:53:11,499 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (let ((.cse7 (store |c_old(#valid)| .cse3 .cse4))) (let ((.cse6 (@diff .cse7 |c_#valid|))) (let ((.cse5 (select |c_#valid| .cse6))) (let ((.cse10 (store .cse7 .cse6 .cse5))) (let ((.cse9 (@diff .cse10 |c_#valid|))) (let ((.cse8 (select |c_#valid| .cse9))) (and (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (create_internal_~now~0.base Int) (v_alloc_and_zero_internal_~pi~1.base_116 Int)) (let ((.cse0 (store |c_old(#valid)| v_alloc_and_zero_internal_~pi~1.base_116 1))) (and (= (select .cse0 create_internal_~now~0.base) 1) (= |c_#valid| (store .cse0 alloc_and_zero_internal_~pi~1.base 1))))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (v_alloc_and_zero_internal_~pi~1.base_115 Int)) (let ((.cse1 (store |v_#valid_BEFORE_CALL_32| v_alloc_and_zero_internal_~pi~1.base_115 1)) (.cse2 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_32|))) (and (= (select .cse1 .cse2) 1) (= |c_#valid| (store .cse1 alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_32| (store |c_old(#valid)| .cse2 (select |v_#valid_BEFORE_CALL_32| .cse2))))))) (or (= |c_#valid| |c_old(#valid)|) (= (select |c_old(#valid)| .cse3) 0) (= .cse4 1)) (or (= .cse5 1) (= (select |c_old(#valid)| .cse6) 0) (= |c_#valid| .cse7)) (or (= .cse8 1) (= (select |c_old(#valid)| .cse9) 0) (= |c_#valid| .cse10)) (= |c_#valid| (store .cse10 .cse9 .cse8))))))))))) is different from false [2024-11-22 18:53:11,503 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (let ((.cse7 (store |c_old(#valid)| .cse3 .cse4))) (let ((.cse6 (@diff .cse7 |c_#valid|))) (let ((.cse5 (select |c_#valid| .cse6))) (let ((.cse10 (store .cse7 .cse6 .cse5))) (let ((.cse9 (@diff .cse10 |c_#valid|))) (let ((.cse8 (select |c_#valid| .cse9))) (and (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (create_internal_~now~0.base Int) (v_alloc_and_zero_internal_~pi~1.base_116 Int)) (let ((.cse0 (store |c_old(#valid)| v_alloc_and_zero_internal_~pi~1.base_116 1))) (and (= (select .cse0 create_internal_~now~0.base) 1) (= |c_#valid| (store .cse0 alloc_and_zero_internal_~pi~1.base 1))))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (v_alloc_and_zero_internal_~pi~1.base_115 Int)) (let ((.cse1 (store |v_#valid_BEFORE_CALL_32| v_alloc_and_zero_internal_~pi~1.base_115 1)) (.cse2 (@diff |c_old(#valid)| |v_#valid_BEFORE_CALL_32|))) (and (= (select .cse1 .cse2) 1) (= |c_#valid| (store .cse1 alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_32| (store |c_old(#valid)| .cse2 (select |v_#valid_BEFORE_CALL_32| .cse2))))))) (or (= |c_#valid| |c_old(#valid)|) (= (select |c_old(#valid)| .cse3) 0) (= .cse4 1)) (or (= .cse5 1) (= (select |c_old(#valid)| .cse6) 0) (= |c_#valid| .cse7)) (or (= .cse8 1) (= (select |c_old(#valid)| .cse9) 0) (= |c_#valid| .cse10)) (= |c_#valid| (store .cse10 .cse9 .cse8))))))))))) is different from true [2024-11-22 18:53:11,509 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and (or (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (v_alloc_and_zero_internal_~pi~1.base_115 Int)) (let ((.cse0 (store |v_#valid_BEFORE_CALL_32| v_alloc_and_zero_internal_~pi~1.base_115 1)) (.cse1 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_32|))) (and (= |c_#valid| (store .cse0 alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_32| (store |v_old(#valid)_AFTER_CALL_50| .cse1 (select |v_#valid_BEFORE_CALL_32| .cse1))) (= (select .cse0 .cse1) 1)))) (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and .cse2 (exists ((v_alloc_and_zero_internal_~pi~1.base_116 Int)) (= (select |c_#valid| v_alloc_and_zero_internal_~pi~1.base_116) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1)))) .cse2)) is different from false [2024-11-22 18:53:11,511 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and (or (exists ((|v_old(#valid)_AFTER_CALL_50| (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_#valid_BEFORE_CALL_32| (Array Int Int)) (v_alloc_and_zero_internal_~pi~1.base_115 Int)) (let ((.cse0 (store |v_#valid_BEFORE_CALL_32| v_alloc_and_zero_internal_~pi~1.base_115 1)) (.cse1 (@diff |v_old(#valid)_AFTER_CALL_50| |v_#valid_BEFORE_CALL_32|))) (and (= |c_#valid| (store .cse0 alloc_and_zero_internal_~pi~1.base 1)) (= |v_#valid_BEFORE_CALL_32| (store |v_old(#valid)_AFTER_CALL_50| .cse1 (select |v_#valid_BEFORE_CALL_32| .cse1))) (= (select .cse0 .cse1) 1)))) (= (select |v_old(#valid)_AFTER_CALL_50| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and .cse2 (exists ((v_alloc_and_zero_internal_~pi~1.base_116 Int)) (= (select |c_#valid| v_alloc_and_zero_internal_~pi~1.base_116) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (select |c_#valid| alloc_and_zero_internal_~pi~1.base) 1)))) .cse2)) is different from true [2024-11-22 18:53:11,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:53:11,660 INFO L93 Difference]: Finished difference Result 252 states and 327 transitions. [2024-11-22 18:53:11,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-22 18:53:11,660 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 20 states have internal predecessors, (61), 7 states have call successors, (7), 2 states have call predecessors, (7), 7 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) Word has length 48 [2024-11-22 18:53:11,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:53:11,661 INFO L225 Difference]: With dead ends: 252 [2024-11-22 18:53:11,661 INFO L226 Difference]: Without dead ends: 252 [2024-11-22 18:53:11,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=189, Invalid=650, Unknown=25, NotChecked=858, Total=1722 [2024-11-22 18:53:11,662 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 62 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 1940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1198 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 18:53:11,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 858 Invalid, 1940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 692 Invalid, 0 Unknown, 1198 Unchecked, 0.4s Time] [2024-11-22 18:53:11,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-11-22 18:53:11,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 237. [2024-11-22 18:53:11,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 193 states have (on average 1.4145077720207253) internal successors, (273), 213 states have internal predecessors, (273), 12 states have call successors, (12), 3 states have call predecessors, (12), 6 states have return successors, (24), 20 states have call predecessors, (24), 12 states have call successors, (24) [2024-11-22 18:53:11,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 309 transitions. [2024-11-22 18:53:11,667 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 309 transitions. Word has length 48 [2024-11-22 18:53:11,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:53:11,667 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 309 transitions. [2024-11-22 18:53:11,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 20 states have internal predecessors, (61), 7 states have call successors, (7), 2 states have call predecessors, (7), 7 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-22 18:53:11,667 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 309 transitions. [2024-11-22 18:53:11,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-22 18:53:11,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:53:11,668 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2024-11-22 18:53:11,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-22 18:53:11,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-22 18:53:11,869 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-22 18:53:11,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:53:11,869 INFO L85 PathProgramCache]: Analyzing trace with hash -665102321, now seen corresponding path program 2 times [2024-11-22 18:53:11,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:53:11,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587784827] [2024-11-22 18:53:11,869 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 18:53:11,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:53:11,888 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 18:53:11,888 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:53:12,822 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-22 18:53:12,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:53:12,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587784827] [2024-11-22 18:53:12,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587784827] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:53:12,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10627200] [2024-11-22 18:53:12,822 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 18:53:12,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:53:12,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:53:12,825 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:53:12,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-22 18:53:12,934 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 18:53:12,934 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:53:12,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-22 18:53:12,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:53:12,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-22 18:53:12,955 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-11-22 18:53:13,217 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base (select |c_#valid| alloc_and_zero_internal_~pi~1.base))) (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2024-11-22 18:53:13,666 INFO L349 Elim1Store]: treesize reduction 119, result has 29.6 percent of original size [2024-11-22 18:53:13,666 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 73 treesize of output 141 [2024-11-22 18:53:13,768 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:53:13,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 127 treesize of output 233 [2024-11-22 18:53:15,563 INFO L349 Elim1Store]: treesize reduction 65, result has 11.0 percent of original size [2024-11-22 18:53:15,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 27 [2024-11-22 18:53:15,635 INFO L349 Elim1Store]: treesize reduction 134, result has 11.3 percent of original size [2024-11-22 18:53:15,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 42 treesize of output 38 [2024-11-22 18:53:15,717 INFO L349 Elim1Store]: treesize reduction 118, result has 12.6 percent of original size [2024-11-22 18:53:15,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 42 treesize of output 38 [2024-11-22 18:53:15,745 INFO L349 Elim1Store]: treesize reduction 49, result has 14.0 percent of original size [2024-11-22 18:53:15,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 27 [2024-11-22 18:53:15,895 INFO L349 Elim1Store]: treesize reduction 167, result has 29.5 percent of original size [2024-11-22 18:53:15,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 82 treesize of output 158 [2024-11-22 18:53:16,203 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 18:53:16,203 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 18:53:16,208 INFO L349 Elim1Store]: treesize reduction 59, result has 1.7 percent of original size [2024-11-22 18:53:16,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 30 treesize of output 7 [2024-11-22 18:53:16,250 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-22 18:53:16,262 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-22 18:53:16,276 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-22 18:53:18,462 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 8 not checked. [2024-11-22 18:53:18,462 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:53:18,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10627200] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:53:18,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:53:18,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 30 [2024-11-22 18:53:18,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086958542] [2024-11-22 18:53:18,736 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:53:18,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-22 18:53:18,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:53:18,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-22 18:53:18,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=854, Unknown=1, NotChecked=60, Total=1056 [2024-11-22 18:53:18,737 INFO L87 Difference]: Start difference. First operand 237 states and 309 transitions. Second operand has 31 states, 28 states have (on average 2.607142857142857) internal successors, (73), 24 states have internal predecessors, (73), 8 states have call successors, (8), 2 states have call predecessors, (8), 10 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-22 18:53:21,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:53:21,675 INFO L93 Difference]: Finished difference Result 264 states and 344 transitions. [2024-11-22 18:53:21,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-22 18:53:21,676 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 2.607142857142857) internal successors, (73), 24 states have internal predecessors, (73), 8 states have call successors, (8), 2 states have call predecessors, (8), 10 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) Word has length 48 [2024-11-22 18:53:21,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:53:21,677 INFO L225 Difference]: With dead ends: 264 [2024-11-22 18:53:21,677 INFO L226 Difference]: Without dead ends: 264 [2024-11-22 18:53:21,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=186, Invalid=1223, Unknown=1, NotChecked=72, Total=1482 [2024-11-22 18:53:21,677 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 67 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 1122 mSolverCounterSat, 32 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 1331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1122 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 176 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-22 18:53:21,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 1098 Invalid, 1331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1122 Invalid, 1 Unknown, 176 Unchecked, 1.5s Time] [2024-11-22 18:53:21,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-22 18:53:21,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 243. [2024-11-22 18:53:21,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 199 states have (on average 1.4170854271356783) internal successors, (282), 218 states have internal predecessors, (282), 12 states have call successors, (12), 3 states have call predecessors, (12), 6 states have return successors, (24), 21 states have call predecessors, (24), 12 states have call successors, (24) [2024-11-22 18:53:21,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 318 transitions. [2024-11-22 18:53:21,681 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 318 transitions. Word has length 48 [2024-11-22 18:53:21,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:53:21,681 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 318 transitions. [2024-11-22 18:53:21,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 28 states have (on average 2.607142857142857) internal successors, (73), 24 states have internal predecessors, (73), 8 states have call successors, (8), 2 states have call predecessors, (8), 10 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-22 18:53:21,681 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 318 transitions. [2024-11-22 18:53:21,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-22 18:53:21,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:53:21,682 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:53:21,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-22 18:53:21,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:53:21,883 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-11-22 18:53:21,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:53:21,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1605139363, now seen corresponding path program 1 times [2024-11-22 18:53:21,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:53:21,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719813175] [2024-11-22 18:53:21,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:53:21,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:53:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:53:22,468 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:53:22,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:53:22,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719813175] [2024-11-22 18:53:22,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719813175] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:53:22,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629820559] [2024-11-22 18:53:22,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:53:22,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:53:22,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:53:22,470 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:53:22,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-22 18:53:22,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:53:22,578 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 90 conjuncts are in the unsatisfiable core [2024-11-22 18:53:22,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:53:22,582 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-11-22 18:53:22,685 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-11-22 18:53:22,699 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-11-22 18:53:22,751 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 18:53:22,751 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-11-22 18:53:22,781 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 35 treesize of output 19 [2024-11-22 18:53:22,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-22 18:53:22,881 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-11-22 18:53:22,964 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-22 18:53:22,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 16 [2024-11-22 18:53:22,967 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:53:22,967 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:53:23,231 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 24 [2024-11-22 18:53:29,947 INFO L349 Elim1Store]: treesize reduction 198, result has 57.0 percent of original size [2024-11-22 18:53:29,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 11 new quantified variables, introduced 45 case distinctions, treesize of input 2804 treesize of output 2752 [2024-11-22 18:53:30,320 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:53:30,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 1242 treesize of output 1471