./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-broom/dll-lst-shared.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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/dll-lst-shared.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 6f8708414d69d58e69308ef3f6436b82a3a2ac306b0f68b7007fd3139e12ef15 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:54:00,720 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:54:00,773 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-09 07:54:00,780 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:54:00,781 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:54:00,807 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:54:00,808 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:54:00,808 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:54:00,809 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:54:00,809 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:54:00,809 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:54:00,810 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:54:00,810 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:54:00,810 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:54:00,811 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:54:00,811 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:54:00,811 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:54:00,811 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:54:00,812 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:54:00,812 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:54:00,812 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:54:00,813 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:54:00,814 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:54:00,814 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:54:00,814 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:54:00,814 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:54:00,815 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:54:00,815 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:54:00,815 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:54:00,816 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:54:00,816 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:54:00,816 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:54:00,816 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:54:00,817 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:54:00,817 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:54:00,817 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:54:00,817 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:54:00,818 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:54:00,818 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:54:00,818 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 -> 6f8708414d69d58e69308ef3f6436b82a3a2ac306b0f68b7007fd3139e12ef15 [2024-11-09 07:54:01,035 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:54:01,066 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:54:01,068 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:54:01,069 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:54:01,070 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:54:01,071 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-broom/dll-lst-shared.i [2024-11-09 07:54:02,342 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:54:02,586 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:54:02,587 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/dll-lst-shared.i [2024-11-09 07:54:02,614 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7b691de0/350b208095be4ac7bb023045db8541d0/FLAG4b98c5e19 [2024-11-09 07:54:02,630 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7b691de0/350b208095be4ac7bb023045db8541d0 [2024-11-09 07:54:02,633 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:54:02,634 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:54:02,637 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:54:02,637 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:54:02,642 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:54:02,642 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:54:02" (1/1) ... [2024-11-09 07:54:02,643 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53cb0b51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:54:02, skipping insertion in model container [2024-11-09 07:54:02,643 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:54:02" (1/1) ... [2024-11-09 07:54:02,688 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:54:02,965 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:54:02,973 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:54:03,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:54:03,029 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:54:03,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:54:03 WrapperNode [2024-11-09 07:54:03,029 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:54:03,030 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:54:03,030 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:54:03,030 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:54:03,035 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:54:03" (1/1) ... [2024-11-09 07:54:03,045 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:54:03" (1/1) ... [2024-11-09 07:54:03,062 INFO L138 Inliner]: procedures = 121, calls = 26, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 78 [2024-11-09 07:54:03,063 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:54:03,063 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:54:03,063 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:54:03,064 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:54:03,074 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:54:03" (1/1) ... [2024-11-09 07:54:03,075 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:54:03" (1/1) ... [2024-11-09 07:54:03,077 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:54:03" (1/1) ... [2024-11-09 07:54:03,098 INFO L175 MemorySlicer]: Split 14 memory accesses to 1 slices as follows [14]. 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-09 07:54:03,098 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:54:03" (1/1) ... [2024-11-09 07:54:03,099 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:54:03" (1/1) ... [2024-11-09 07:54:03,104 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:54:03" (1/1) ... [2024-11-09 07:54:03,106 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:54:03" (1/1) ... [2024-11-09 07:54:03,107 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:54:03" (1/1) ... [2024-11-09 07:54:03,108 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:54:03" (1/1) ... [2024-11-09 07:54:03,110 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:54:03,111 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:54:03,111 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:54:03,111 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:54:03,111 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:54:03" (1/1) ... [2024-11-09 07:54:03,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:54:03,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:54:03,135 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-09 07:54:03,137 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-09 07:54:03,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 07:54:03,175 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2024-11-09 07:54:03,175 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2024-11-09 07:54:03,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:54:03,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 07:54:03,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 07:54:03,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:54:03,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:54:03,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:54:03,265 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:54:03,267 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:54:03,483 INFO L? ?]: Removed 88 outVars from TransFormulas that were not future-live. [2024-11-09 07:54:03,483 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:54:03,505 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:54:03,505 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-09 07:54:03,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:54:03 BoogieIcfgContainer [2024-11-09 07:54:03,505 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:54:03,509 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:54:03,509 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:54:03,512 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:54:03,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:54:02" (1/3) ... [2024-11-09 07:54:03,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2356db11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:54:03, skipping insertion in model container [2024-11-09 07:54:03,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:54:03" (2/3) ... [2024-11-09 07:54:03,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2356db11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:54:03, skipping insertion in model container [2024-11-09 07:54:03,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:54:03" (3/3) ... [2024-11-09 07:54:03,514 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-lst-shared.i [2024-11-09 07:54:03,529 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:54:03,529 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 35 error locations. [2024-11-09 07:54:03,575 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:54:03,580 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;@7784365d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:54:03,581 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2024-11-09 07:54:03,586 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 46 states have (on average 1.9130434782608696) internal successors, (88), 81 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:54:03,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 07:54:03,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:03,593 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 07:54:03,594 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 32 more)] === [2024-11-09 07:54:03,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:03,599 INFO L85 PathProgramCache]: Analyzing trace with hash 37387707, now seen corresponding path program 1 times [2024-11-09 07:54:03,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:03,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791964313] [2024-11-09 07:54:03,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:03,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:03,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:03,849 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-09 07:54:03,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:03,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791964313] [2024-11-09 07:54:03,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791964313] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:54:03,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:54:03,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:54:03,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409844122] [2024-11-09 07:54:03,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:54:03,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:54:03,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:03,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:54:03,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:54:03,915 INFO L87 Difference]: Start difference. First operand has 85 states, 46 states have (on average 1.9130434782608696) internal successors, (88), 81 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) 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-09 07:54:03,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:03,997 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2024-11-09 07:54:03,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:54:04,000 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-09 07:54:04,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:04,006 INFO L225 Difference]: With dead ends: 83 [2024-11-09 07:54:04,007 INFO L226 Difference]: Without dead ends: 81 [2024-11-09 07:54:04,008 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-09 07:54:04,013 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 2 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:04,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 130 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:54:04,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-09 07:54:04,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-09 07:54:04,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 45 states have (on average 1.8) internal successors, (81), 77 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:54:04,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2024-11-09 07:54:04,048 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 5 [2024-11-09 07:54:04,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:04,048 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2024-11-09 07:54:04,048 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-09 07:54:04,049 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2024-11-09 07:54:04,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 07:54:04,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:04,049 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 07:54:04,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:54:04,049 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 32 more)] === [2024-11-09 07:54:04,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:04,050 INFO L85 PathProgramCache]: Analyzing trace with hash 37387708, now seen corresponding path program 1 times [2024-11-09 07:54:04,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:04,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664791413] [2024-11-09 07:54:04,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:04,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:04,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:04,124 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-09 07:54:04,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:04,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664791413] [2024-11-09 07:54:04,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664791413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:54:04,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:54:04,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:54:04,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204755246] [2024-11-09 07:54:04,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:54:04,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:54:04,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:04,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:54:04,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:54:04,129 INFO L87 Difference]: Start difference. First operand 81 states and 85 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-09 07:54:04,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:04,177 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2024-11-09 07:54:04,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:54:04,177 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-09 07:54:04,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:04,178 INFO L225 Difference]: With dead ends: 79 [2024-11-09 07:54:04,178 INFO L226 Difference]: Without dead ends: 79 [2024-11-09 07:54:04,179 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-09 07:54:04,179 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 2 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:04,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 134 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:54:04,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-09 07:54:04,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-09 07:54:04,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 45 states have (on average 1.7555555555555555) internal successors, (79), 75 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:54:04,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2024-11-09 07:54:04,185 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 5 [2024-11-09 07:54:04,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:04,186 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2024-11-09 07:54:04,186 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-09 07:54:04,186 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2024-11-09 07:54:04,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 07:54:04,186 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:04,186 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:54:04,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:54:04,187 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-09 07:54:04,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:04,187 INFO L85 PathProgramCache]: Analyzing trace with hash -802469099, now seen corresponding path program 1 times [2024-11-09 07:54:04,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:04,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782445909] [2024-11-09 07:54:04,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:04,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:04,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:04,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:04,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:04,338 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-09 07:54:04,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:04,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782445909] [2024-11-09 07:54:04,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782445909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:54:04,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:54:04,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:54:04,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542537343] [2024-11-09 07:54:04,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:54:04,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:54:04,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:04,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:54:04,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:54:04,342 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:54:04,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:04,439 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2024-11-09 07:54:04,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:54:04,441 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-09 07:54:04,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:04,446 INFO L225 Difference]: With dead ends: 83 [2024-11-09 07:54:04,446 INFO L226 Difference]: Without dead ends: 83 [2024-11-09 07:54:04,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:54:04,449 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 9 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:04,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 159 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:54:04,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-09 07:54:04,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 78. [2024-11-09 07:54:04,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 45 states have (on average 1.7333333333333334) internal successors, (78), 74 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:54:04,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2024-11-09 07:54:04,456 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 11 [2024-11-09 07:54:04,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:04,456 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2024-11-09 07:54:04,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:54:04,457 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2024-11-09 07:54:04,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 07:54:04,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:04,457 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:54:04,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:54:04,458 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-09 07:54:04,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:04,458 INFO L85 PathProgramCache]: Analyzing trace with hash -802469100, now seen corresponding path program 1 times [2024-11-09 07:54:04,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:04,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177010627] [2024-11-09 07:54:04,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:04,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:04,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:04,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:04,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:04,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:54:04,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:04,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177010627] [2024-11-09 07:54:04,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177010627] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:54:04,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:54:04,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:54:04,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696993671] [2024-11-09 07:54:04,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:54:04,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:54:04,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:04,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:54:04,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:54:04,527 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:54:04,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:04,601 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2024-11-09 07:54:04,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:54:04,602 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-09 07:54:04,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:04,602 INFO L225 Difference]: With dead ends: 82 [2024-11-09 07:54:04,603 INFO L226 Difference]: Without dead ends: 82 [2024-11-09 07:54:04,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:54:04,604 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 9 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:04,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 153 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:54:04,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-09 07:54:04,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2024-11-09 07:54:04,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 45 states have (on average 1.711111111111111) internal successors, (77), 73 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:54:04,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2024-11-09 07:54:04,615 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 11 [2024-11-09 07:54:04,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:04,616 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2024-11-09 07:54:04,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:54:04,616 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2024-11-09 07:54:04,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 07:54:04,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:04,617 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:54:04,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:54:04,617 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-09 07:54:04,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:04,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1921307765, now seen corresponding path program 1 times [2024-11-09 07:54:04,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:04,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975718540] [2024-11-09 07:54:04,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:04,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:04,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:04,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:04,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:04,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:54:04,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:04,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975718540] [2024-11-09 07:54:04,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975718540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:54:04,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:54:04,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:54:04,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438077682] [2024-11-09 07:54:04,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:54:04,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:54:04,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:04,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:54:04,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:54:04,830 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:54:04,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:04,990 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2024-11-09 07:54:04,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:54:04,991 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-09 07:54:04,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:04,992 INFO L225 Difference]: With dead ends: 78 [2024-11-09 07:54:04,992 INFO L226 Difference]: Without dead ends: 78 [2024-11-09 07:54:04,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:54:04,993 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 16 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:04,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 265 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:54:04,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-09 07:54:05,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2024-11-09 07:54:05,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 45 states have (on average 1.6222222222222222) internal successors, (73), 69 states have internal predecessors, (73), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:54:05,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2024-11-09 07:54:05,004 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 13 [2024-11-09 07:54:05,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:05,005 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2024-11-09 07:54:05,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:54:05,005 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2024-11-09 07:54:05,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 07:54:05,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:05,006 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:54:05,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:54:05,006 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-09 07:54:05,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:05,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1921307766, now seen corresponding path program 1 times [2024-11-09 07:54:05,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:05,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839323172] [2024-11-09 07:54:05,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:05,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:05,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:05,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:05,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:05,347 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-09 07:54:05,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:05,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839323172] [2024-11-09 07:54:05,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839323172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:54:05,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:54:05,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:54:05,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360396718] [2024-11-09 07:54:05,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:54:05,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:54:05,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:05,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:54:05,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:54:05,352 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:54:05,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:05,479 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2024-11-09 07:54:05,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:54:05,480 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-09 07:54:05,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:05,481 INFO L225 Difference]: With dead ends: 77 [2024-11-09 07:54:05,481 INFO L226 Difference]: Without dead ends: 77 [2024-11-09 07:54:05,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:54:05,483 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 6 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:05,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 304 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:54:05,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-09 07:54:05,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2024-11-09 07:54:05,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 45 states have (on average 1.6) internal successors, (72), 68 states have internal predecessors, (72), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:54:05,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2024-11-09 07:54:05,489 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 13 [2024-11-09 07:54:05,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:05,490 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2024-11-09 07:54:05,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:54:05,492 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2024-11-09 07:54:05,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 07:54:05,492 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:05,492 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:54:05,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:54:05,493 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-09 07:54:05,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:05,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1295463995, now seen corresponding path program 1 times [2024-11-09 07:54:05,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:05,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020840426] [2024-11-09 07:54:05,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:05,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:05,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:05,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:05,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:05,618 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-09 07:54:05,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:05,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020840426] [2024-11-09 07:54:05,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020840426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:54:05,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:54:05,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:54:05,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469975574] [2024-11-09 07:54:05,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:54:05,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:54:05,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:05,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:54:05,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:54:05,620 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:54:05,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:05,750 INFO L93 Difference]: Finished difference Result 101 states and 113 transitions. [2024-11-09 07:54:05,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:54:05,751 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-11-09 07:54:05,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:05,751 INFO L225 Difference]: With dead ends: 101 [2024-11-09 07:54:05,751 INFO L226 Difference]: Without dead ends: 101 [2024-11-09 07:54:05,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-09 07:54:05,752 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 42 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:05,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 250 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:54:05,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-09 07:54:05,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 91. [2024-11-09 07:54:05,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 63 states have (on average 1.6349206349206349) internal successors, (103), 86 states have internal predecessors, (103), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:54:05,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 109 transitions. [2024-11-09 07:54:05,763 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 109 transitions. Word has length 19 [2024-11-09 07:54:05,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:05,764 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 109 transitions. [2024-11-09 07:54:05,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:54:05,764 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 109 transitions. [2024-11-09 07:54:05,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 07:54:05,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:05,765 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:54:05,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:54:05,765 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-09 07:54:05,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:05,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1295463996, now seen corresponding path program 1 times [2024-11-09 07:54:05,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:05,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937298609] [2024-11-09 07:54:05,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:05,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:05,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:05,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:05,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:05,949 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-09 07:54:05,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:05,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937298609] [2024-11-09 07:54:05,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937298609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:54:05,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:54:05,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 07:54:05,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698900542] [2024-11-09 07:54:05,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:54:05,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:54:05,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:05,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:54:05,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:54:05,951 INFO L87 Difference]: Start difference. First operand 91 states and 109 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:54:06,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:06,119 INFO L93 Difference]: Finished difference Result 109 states and 122 transitions. [2024-11-09 07:54:06,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 07:54:06,120 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-11-09 07:54:06,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:06,120 INFO L225 Difference]: With dead ends: 109 [2024-11-09 07:54:06,121 INFO L226 Difference]: Without dead ends: 109 [2024-11-09 07:54:06,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:54:06,122 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 42 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:06,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 416 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:54:06,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-09 07:54:06,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 97. [2024-11-09 07:54:06,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.6231884057971016) internal successors, (112), 92 states have internal predecessors, (112), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:54:06,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 118 transitions. [2024-11-09 07:54:06,132 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 118 transitions. Word has length 19 [2024-11-09 07:54:06,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:06,132 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 118 transitions. [2024-11-09 07:54:06,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:54:06,132 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 118 transitions. [2024-11-09 07:54:06,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 07:54:06,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:06,134 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:54:06,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 07:54:06,135 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-09 07:54:06,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:06,135 INFO L85 PathProgramCache]: Analyzing trace with hash -599661973, now seen corresponding path program 1 times [2024-11-09 07:54:06,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:06,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570208379] [2024-11-09 07:54:06,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:06,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:06,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:06,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:06,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:06,249 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-09 07:54:06,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:06,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570208379] [2024-11-09 07:54:06,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570208379] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:54:06,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:54:06,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 07:54:06,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984554620] [2024-11-09 07:54:06,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:54:06,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:54:06,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:06,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:54:06,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:54:06,255 INFO L87 Difference]: Start difference. First operand 97 states and 118 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:54:06,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:06,338 INFO L93 Difference]: Finished difference Result 106 states and 129 transitions. [2024-11-09 07:54:06,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:54:06,339 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-11-09 07:54:06,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:06,340 INFO L225 Difference]: With dead ends: 106 [2024-11-09 07:54:06,340 INFO L226 Difference]: Without dead ends: 106 [2024-11-09 07:54:06,340 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-09 07:54:06,340 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 26 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:06,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 450 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:54:06,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-09 07:54:06,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. [2024-11-09 07:54:06,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 70 states have (on average 1.6) internal successors, (112), 93 states have internal predecessors, (112), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:54:06,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2024-11-09 07:54:06,345 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 21 [2024-11-09 07:54:06,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:06,345 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2024-11-09 07:54:06,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:54:06,345 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2024-11-09 07:54:06,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 07:54:06,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:06,346 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:54:06,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 07:54:06,346 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-09 07:54:06,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:06,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1408205040, now seen corresponding path program 1 times [2024-11-09 07:54:06,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:06,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944868526] [2024-11-09 07:54:06,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:06,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:06,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:06,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:06,445 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-09 07:54:06,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:06,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944868526] [2024-11-09 07:54:06,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944868526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:54:06,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:54:06,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:54:06,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517624607] [2024-11-09 07:54:06,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:54:06,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:54:06,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:06,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:54:06,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:54:06,447 INFO L87 Difference]: Start difference. First operand 98 states and 118 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:54:06,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:06,568 INFO L93 Difference]: Finished difference Result 111 states and 126 transitions. [2024-11-09 07:54:06,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:54:06,569 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-11-09 07:54:06,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:06,569 INFO L225 Difference]: With dead ends: 111 [2024-11-09 07:54:06,570 INFO L226 Difference]: Without dead ends: 111 [2024-11-09 07:54:06,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-09 07:54:06,570 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 34 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:06,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 248 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:54:06,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-09 07:54:06,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 102. [2024-11-09 07:54:06,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 74 states have (on average 1.5810810810810811) internal successors, (117), 97 states have internal predecessors, (117), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:54:06,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 123 transitions. [2024-11-09 07:54:06,577 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 123 transitions. Word has length 22 [2024-11-09 07:54:06,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:06,577 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 123 transitions. [2024-11-09 07:54:06,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:54:06,578 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 123 transitions. [2024-11-09 07:54:06,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 07:54:06,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:06,578 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:54:06,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 07:54:06,578 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-09 07:54:06,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:06,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1408205039, now seen corresponding path program 1 times [2024-11-09 07:54:06,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:06,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483939591] [2024-11-09 07:54:06,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:06,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:06,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:06,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:06,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:06,941 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-09 07:54:06,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:06,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483939591] [2024-11-09 07:54:06,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483939591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:54:06,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:54:06,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 07:54:06,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521727074] [2024-11-09 07:54:06,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:54:06,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 07:54:06,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:06,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 07:54:06,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:54:06,944 INFO L87 Difference]: Start difference. First operand 102 states and 123 transitions. Second operand has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:54:07,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:07,110 INFO L93 Difference]: Finished difference Result 109 states and 130 transitions. [2024-11-09 07:54:07,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:54:07,110 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-11-09 07:54:07,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:07,111 INFO L225 Difference]: With dead ends: 109 [2024-11-09 07:54:07,111 INFO L226 Difference]: Without dead ends: 109 [2024-11-09 07:54:07,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:54:07,112 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 8 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:07,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 314 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:54:07,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-09 07:54:07,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-09 07:54:07,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 81 states have (on average 1.5308641975308641) internal successors, (124), 104 states have internal predecessors, (124), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:54:07,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 130 transitions. [2024-11-09 07:54:07,115 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 130 transitions. Word has length 22 [2024-11-09 07:54:07,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:07,116 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 130 transitions. [2024-11-09 07:54:07,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:54:07,116 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 130 transitions. [2024-11-09 07:54:07,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 07:54:07,117 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:07,117 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:54:07,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 07:54:07,117 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-09 07:54:07,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:07,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1461881377, now seen corresponding path program 1 times [2024-11-09 07:54:07,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:07,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658908273] [2024-11-09 07:54:07,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:07,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:07,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:07,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:07,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:07,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 07:54:07,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:07,258 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:54:07,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:07,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658908273] [2024-11-09 07:54:07,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658908273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:54:07,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:54:07,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:54:07,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828578873] [2024-11-09 07:54:07,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:54:07,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:54:07,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:07,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:54:07,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:54:07,259 INFO L87 Difference]: Start difference. First operand 109 states and 130 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:54:07,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:07,345 INFO L93 Difference]: Finished difference Result 109 states and 129 transitions. [2024-11-09 07:54:07,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:54:07,345 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2024-11-09 07:54:07,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:07,346 INFO L225 Difference]: With dead ends: 109 [2024-11-09 07:54:07,346 INFO L226 Difference]: Without dead ends: 109 [2024-11-09 07:54:07,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:54:07,347 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 14 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:07,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 128 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:54:07,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-09 07:54:07,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-09 07:54:07,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 81 states have (on average 1.5185185185185186) internal successors, (123), 104 states have internal predecessors, (123), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:54:07,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 129 transitions. [2024-11-09 07:54:07,352 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 129 transitions. Word has length 23 [2024-11-09 07:54:07,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:07,352 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 129 transitions. [2024-11-09 07:54:07,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:54:07,352 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 129 transitions. [2024-11-09 07:54:07,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 07:54:07,354 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:07,354 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:54:07,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 07:54:07,354 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-09 07:54:07,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:07,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1461881378, now seen corresponding path program 1 times [2024-11-09 07:54:07,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:07,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008580919] [2024-11-09 07:54:07,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:07,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:07,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:07,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:07,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:07,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 07:54:07,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:07,698 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:54:07,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:07,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008580919] [2024-11-09 07:54:07,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008580919] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:54:07,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996291924] [2024-11-09 07:54:07,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:07,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:54:07,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:54:07,701 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-09 07:54:07,704 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-09 07:54:07,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:07,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 07:54:07,809 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:54:07,854 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-09 07:54:07,862 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-09 07:54:07,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:54:07,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 07:54:07,958 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:54:07,958 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-09 07:54:08,043 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2024-11-09 07:54:08,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:54:08,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 07:54:08,079 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:54:08,079 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-09 07:54:08,082 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-09 07:54:08,083 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:54:08,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996291924] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:54:08,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:54:08,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2024-11-09 07:54:08,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392342075] [2024-11-09 07:54:08,202 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:54:08,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 07:54:08,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:08,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 07:54:08,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=321, Unknown=1, NotChecked=36, Total=420 [2024-11-09 07:54:08,203 INFO L87 Difference]: Start difference. First operand 109 states and 129 transitions. Second operand has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 14 states have internal predecessors, (35), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:54:08,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:08,447 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2024-11-09 07:54:08,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:54:08,448 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 14 states have internal predecessors, (35), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 23 [2024-11-09 07:54:08,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:08,448 INFO L225 Difference]: With dead ends: 113 [2024-11-09 07:54:08,448 INFO L226 Difference]: Without dead ends: 113 [2024-11-09 07:54:08,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=391, Unknown=1, NotChecked=40, Total=506 [2024-11-09 07:54:08,449 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 58 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:08,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 352 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 311 Invalid, 0 Unknown, 91 Unchecked, 0.2s Time] [2024-11-09 07:54:08,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-09 07:54:08,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 109. [2024-11-09 07:54:08,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 81 states have (on average 1.4691358024691359) internal successors, (119), 104 states have internal predecessors, (119), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:54:08,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 125 transitions. [2024-11-09 07:54:08,452 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 125 transitions. Word has length 23 [2024-11-09 07:54:08,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:08,452 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 125 transitions. [2024-11-09 07:54:08,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 14 states have internal predecessors, (35), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:54:08,453 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 125 transitions. [2024-11-09 07:54:08,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 07:54:08,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:08,453 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] [2024-11-09 07:54:08,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 07:54:08,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-09 07:54:08,658 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-09 07:54:08,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:08,659 INFO L85 PathProgramCache]: Analyzing trace with hash -60274233, now seen corresponding path program 1 times [2024-11-09 07:54:08,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:08,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265837599] [2024-11-09 07:54:08,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:08,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:08,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:08,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:08,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:08,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 07:54:08,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:08,800 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:54:08,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:08,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265837599] [2024-11-09 07:54:08,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265837599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:54:08,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:54:08,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:54:08,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183099918] [2024-11-09 07:54:08,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:54:08,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:54:08,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:08,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:54:08,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:54:08,803 INFO L87 Difference]: Start difference. First operand 109 states and 125 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:54:08,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:08,945 INFO L93 Difference]: Finished difference Result 108 states and 123 transitions. [2024-11-09 07:54:08,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:54:08,946 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2024-11-09 07:54:08,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:08,946 INFO L225 Difference]: With dead ends: 108 [2024-11-09 07:54:08,946 INFO L226 Difference]: Without dead ends: 108 [2024-11-09 07:54:08,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:54:08,947 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 8 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:08,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 279 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:54:08,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-09 07:54:08,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-09 07:54:08,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 81 states have (on average 1.4444444444444444) internal successors, (117), 103 states have internal predecessors, (117), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:54:08,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 123 transitions. [2024-11-09 07:54:08,950 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 123 transitions. Word has length 26 [2024-11-09 07:54:08,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:08,950 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 123 transitions. [2024-11-09 07:54:08,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:54:08,950 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 123 transitions. [2024-11-09 07:54:08,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 07:54:08,951 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:08,951 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] [2024-11-09 07:54:08,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 07:54:08,951 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-09 07:54:08,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:08,952 INFO L85 PathProgramCache]: Analyzing trace with hash -60274232, now seen corresponding path program 1 times [2024-11-09 07:54:08,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:08,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010322371] [2024-11-09 07:54:08,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:08,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:08,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:09,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:09,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:09,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 07:54:09,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:09,191 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:54:09,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:09,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010322371] [2024-11-09 07:54:09,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010322371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:54:09,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:54:09,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:54:09,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345437659] [2024-11-09 07:54:09,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:54:09,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:54:09,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:09,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:54:09,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:54:09,194 INFO L87 Difference]: Start difference. First operand 108 states and 123 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:54:09,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:09,328 INFO L93 Difference]: Finished difference Result 107 states and 121 transitions. [2024-11-09 07:54:09,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:54:09,329 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2024-11-09 07:54:09,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:09,330 INFO L225 Difference]: With dead ends: 107 [2024-11-09 07:54:09,331 INFO L226 Difference]: Without dead ends: 107 [2024-11-09 07:54:09,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:54:09,332 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 3 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:09,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 313 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:54:09,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-09 07:54:09,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-09 07:54:09,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 81 states have (on average 1.4197530864197532) internal successors, (115), 102 states have internal predecessors, (115), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:54:09,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 121 transitions. [2024-11-09 07:54:09,336 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 121 transitions. Word has length 26 [2024-11-09 07:54:09,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:09,336 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 121 transitions. [2024-11-09 07:54:09,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:54:09,336 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 121 transitions. [2024-11-09 07:54:09,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 07:54:09,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:09,337 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:54:09,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 07:54:09,337 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-09 07:54:09,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:09,338 INFO L85 PathProgramCache]: Analyzing trace with hash 862583441, now seen corresponding path program 1 times [2024-11-09 07:54:09,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:09,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752673328] [2024-11-09 07:54:09,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:09,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:09,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:09,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:09,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:09,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:54:09,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:09,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752673328] [2024-11-09 07:54:09,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752673328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:54:09,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:54:09,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:54:09,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14072006] [2024-11-09 07:54:09,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:54:09,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:54:09,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:09,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:54:09,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:54:09,428 INFO L87 Difference]: Start difference. First operand 107 states and 121 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:54:09,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:09,576 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2024-11-09 07:54:09,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:54:09,577 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-11-09 07:54:09,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:09,577 INFO L225 Difference]: With dead ends: 116 [2024-11-09 07:54:09,577 INFO L226 Difference]: Without dead ends: 116 [2024-11-09 07:54:09,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:54:09,578 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 42 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:09,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 229 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:54:09,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-09 07:54:09,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 111. [2024-11-09 07:54:09,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 86 states have (on average 1.430232558139535) internal successors, (123), 106 states have internal predecessors, (123), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:54:09,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 129 transitions. [2024-11-09 07:54:09,583 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 129 transitions. Word has length 27 [2024-11-09 07:54:09,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:09,584 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 129 transitions. [2024-11-09 07:54:09,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:54:09,584 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 129 transitions. [2024-11-09 07:54:09,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 07:54:09,584 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:09,584 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:54:09,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 07:54:09,584 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-09 07:54:09,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:09,585 INFO L85 PathProgramCache]: Analyzing trace with hash 862583442, now seen corresponding path program 1 times [2024-11-09 07:54:09,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:09,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055946656] [2024-11-09 07:54:09,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:09,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:09,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:09,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:09,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:09,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:54:09,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:09,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055946656] [2024-11-09 07:54:09,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055946656] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:54:09,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339542316] [2024-11-09 07:54:09,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:09,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:54:09,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:54:09,765 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-09 07:54:09,766 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-09 07:54:09,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:09,854 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-09 07:54:09,856 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:54:09,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:54:09,976 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:54:10,039 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:54:10,039 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-09 07:54:10,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:54:10,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339542316] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:54:10,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:54:10,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 20 [2024-11-09 07:54:10,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085163606] [2024-11-09 07:54:10,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:54:10,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 07:54:10,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:10,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 07:54:10,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2024-11-09 07:54:10,153 INFO L87 Difference]: Start difference. First operand 111 states and 129 transitions. Second operand has 21 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:54:10,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:10,467 INFO L93 Difference]: Finished difference Result 121 states and 136 transitions. [2024-11-09 07:54:10,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 07:54:10,468 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2024-11-09 07:54:10,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:10,469 INFO L225 Difference]: With dead ends: 121 [2024-11-09 07:54:10,469 INFO L226 Difference]: Without dead ends: 121 [2024-11-09 07:54:10,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=616, Unknown=0, NotChecked=0, Total=702 [2024-11-09 07:54:10,470 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 130 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:10,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 523 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:54:10,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-09 07:54:10,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 114. [2024-11-09 07:54:10,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 90 states have (on average 1.3888888888888888) internal successors, (125), 109 states have internal predecessors, (125), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:54:10,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 131 transitions. [2024-11-09 07:54:10,472 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 131 transitions. Word has length 27 [2024-11-09 07:54:10,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:10,473 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 131 transitions. [2024-11-09 07:54:10,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.15) internal successors, (63), 19 states have internal predecessors, (63), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:54:10,473 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 131 transitions. [2024-11-09 07:54:10,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 07:54:10,473 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:10,473 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:54:10,487 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-09 07:54:10,677 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,SelfDestructingSolverStorable16 [2024-11-09 07:54:10,681 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-09 07:54:10,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:10,681 INFO L85 PathProgramCache]: Analyzing trace with hash 970282953, now seen corresponding path program 1 times [2024-11-09 07:54:10,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:10,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351698947] [2024-11-09 07:54:10,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:10,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:10,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:10,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:10,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:10,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:54:10,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:10,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351698947] [2024-11-09 07:54:10,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351698947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:54:10,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:54:10,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:54:10,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631905013] [2024-11-09 07:54:10,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:54:10,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:54:10,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:10,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:54:10,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:54:10,796 INFO L87 Difference]: Start difference. First operand 114 states and 131 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:54:10,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:10,935 INFO L93 Difference]: Finished difference Result 138 states and 158 transitions. [2024-11-09 07:54:10,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:54:10,935 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2024-11-09 07:54:10,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:10,936 INFO L225 Difference]: With dead ends: 138 [2024-11-09 07:54:10,936 INFO L226 Difference]: Without dead ends: 138 [2024-11-09 07:54:10,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:54:10,937 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 27 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:10,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 334 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:54:10,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-09 07:54:10,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 124. [2024-11-09 07:54:10,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 100 states have (on average 1.39) internal successors, (139), 119 states have internal predecessors, (139), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:54:10,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 145 transitions. [2024-11-09 07:54:10,939 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 145 transitions. Word has length 28 [2024-11-09 07:54:10,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:10,940 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 145 transitions. [2024-11-09 07:54:10,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:54:10,940 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 145 transitions. [2024-11-09 07:54:10,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 07:54:10,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:10,940 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:54:10,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 07:54:10,940 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-09 07:54:10,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:10,941 INFO L85 PathProgramCache]: Analyzing trace with hash 971729834, now seen corresponding path program 1 times [2024-11-09 07:54:10,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:10,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673326656] [2024-11-09 07:54:10,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:10,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:10,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:11,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:11,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:11,494 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:54:11,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:11,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673326656] [2024-11-09 07:54:11,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673326656] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:54:11,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781193447] [2024-11-09 07:54:11,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:11,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:54:11,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:54:11,497 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-09 07:54:11,498 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-09 07:54:11,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:11,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-09 07:54:11,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:54:11,608 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-09 07:54:11,629 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-09 07:54:11,635 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-09 07:54:11,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-09 07:54:11,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-09 07:54:11,796 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:54:11,797 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-09 07:54:11,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-09 07:54:11,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-09 07:54:11,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:54:11,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:54:11,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-09 07:54:11,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:54:11,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:54:11,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-09 07:54:12,119 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:54:12,119 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:54:12,876 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:54:12,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-11-09 07:54:12,893 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:54:12,894 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 36 treesize of output 32 [2024-11-09 07:54:12,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:54:12,933 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:54:12,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-11-09 07:54:12,936 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:54:12,942 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-09 07:54:12,942 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 20 treesize of output 11 [2024-11-09 07:54:12,982 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:54:12,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781193447] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:54:12,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:54:12,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 34 [2024-11-09 07:54:12,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428631596] [2024-11-09 07:54:12,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:54:12,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-09 07:54:12,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:12,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-09 07:54:12,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1012, Unknown=2, NotChecked=0, Total=1122 [2024-11-09 07:54:12,985 INFO L87 Difference]: Start difference. First operand 124 states and 145 transitions. Second operand has 34 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 30 states have internal predecessors, (62), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:54:13,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:13,526 INFO L93 Difference]: Finished difference Result 120 states and 138 transitions. [2024-11-09 07:54:13,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:54:13,526 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 30 states have internal predecessors, (62), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2024-11-09 07:54:13,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:13,527 INFO L225 Difference]: With dead ends: 120 [2024-11-09 07:54:13,527 INFO L226 Difference]: Without dead ends: 120 [2024-11-09 07:54:13,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=141, Invalid=1339, Unknown=2, NotChecked=0, Total=1482 [2024-11-09 07:54:13,528 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 22 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:13,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 884 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:54:13,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-09 07:54:13,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-09 07:54:13,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 96 states have (on average 1.375) internal successors, (132), 115 states have internal predecessors, (132), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:54:13,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 138 transitions. [2024-11-09 07:54:13,531 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 138 transitions. Word has length 28 [2024-11-09 07:54:13,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:13,531 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 138 transitions. [2024-11-09 07:54:13,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 30 states have internal predecessors, (62), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:54:13,531 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 138 transitions. [2024-11-09 07:54:13,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 07:54:13,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:13,532 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] [2024-11-09 07:54:13,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 07:54:13,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:54:13,735 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-09 07:54:13,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:13,736 INFO L85 PathProgramCache]: Analyzing trace with hash -333333623, now seen corresponding path program 1 times [2024-11-09 07:54:13,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:13,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84626585] [2024-11-09 07:54:13,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:13,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:13,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:14,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:14,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:14,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 07:54:14,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:14,074 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:54:14,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:14,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84626585] [2024-11-09 07:54:14,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84626585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:54:14,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:54:14,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 07:54:14,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123596615] [2024-11-09 07:54:14,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:54:14,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 07:54:14,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:14,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 07:54:14,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:54:14,076 INFO L87 Difference]: Start difference. First operand 120 states and 138 transitions. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:54:14,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:14,254 INFO L93 Difference]: Finished difference Result 121 states and 137 transitions. [2024-11-09 07:54:14,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:54:14,255 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2024-11-09 07:54:14,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:14,255 INFO L225 Difference]: With dead ends: 121 [2024-11-09 07:54:14,256 INFO L226 Difference]: Without dead ends: 121 [2024-11-09 07:54:14,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-11-09 07:54:14,256 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 24 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:14,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 361 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:54:14,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-09 07:54:14,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2024-11-09 07:54:14,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 96 states have (on average 1.3645833333333333) internal successors, (131), 115 states have internal predecessors, (131), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:54:14,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 137 transitions. [2024-11-09 07:54:14,260 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 137 transitions. Word has length 29 [2024-11-09 07:54:14,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:14,260 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 137 transitions. [2024-11-09 07:54:14,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:54:14,261 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 137 transitions. [2024-11-09 07:54:14,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 07:54:14,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:14,262 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] [2024-11-09 07:54:14,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 07:54:14,262 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-09 07:54:14,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:14,262 INFO L85 PathProgramCache]: Analyzing trace with hash -333333624, now seen corresponding path program 1 times [2024-11-09 07:54:14,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:14,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514012993] [2024-11-09 07:54:14,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:14,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:14,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:14,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:14,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:14,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 07:54:14,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:14,476 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:54:14,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:14,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514012993] [2024-11-09 07:54:14,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514012993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:54:14,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:54:14,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 07:54:14,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24537957] [2024-11-09 07:54:14,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:54:14,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 07:54:14,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:14,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 07:54:14,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:54:14,478 INFO L87 Difference]: Start difference. First operand 120 states and 137 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:54:14,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:14,666 INFO L93 Difference]: Finished difference Result 120 states and 136 transitions. [2024-11-09 07:54:14,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:54:14,666 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2024-11-09 07:54:14,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:14,667 INFO L225 Difference]: With dead ends: 120 [2024-11-09 07:54:14,667 INFO L226 Difference]: Without dead ends: 120 [2024-11-09 07:54:14,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-11-09 07:54:14,668 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 21 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:14,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 378 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:54:14,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-09 07:54:14,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-09 07:54:14,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 96 states have (on average 1.3541666666666667) internal successors, (130), 115 states have internal predecessors, (130), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:54:14,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 136 transitions. [2024-11-09 07:54:14,671 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 136 transitions. Word has length 29 [2024-11-09 07:54:14,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:14,671 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 136 transitions. [2024-11-09 07:54:14,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:54:14,671 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 136 transitions. [2024-11-09 07:54:14,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 07:54:14,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:14,671 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:54:14,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 07:54:14,672 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-09 07:54:14,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:14,672 INFO L85 PathProgramCache]: Analyzing trace with hash 14345560, now seen corresponding path program 1 times [2024-11-09 07:54:14,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:14,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160420016] [2024-11-09 07:54:14,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:14,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:14,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:14,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:14,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:14,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:54:14,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:14,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160420016] [2024-11-09 07:54:14,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160420016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:54:14,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:54:14,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 07:54:14,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336932300] [2024-11-09 07:54:14,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:54:14,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:54:14,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:14,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:54:14,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:54:14,765 INFO L87 Difference]: Start difference. First operand 120 states and 136 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:54:14,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:14,858 INFO L93 Difference]: Finished difference Result 120 states and 132 transitions. [2024-11-09 07:54:14,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:54:14,859 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2024-11-09 07:54:14,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:14,859 INFO L225 Difference]: With dead ends: 120 [2024-11-09 07:54:14,859 INFO L226 Difference]: Without dead ends: 120 [2024-11-09 07:54:14,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:54:14,860 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 35 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:14,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 407 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:54:14,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-09 07:54:14,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2024-11-09 07:54:14,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 94 states have (on average 1.3085106382978724) internal successors, (123), 113 states have internal predecessors, (123), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:54:14,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 129 transitions. [2024-11-09 07:54:14,862 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 129 transitions. Word has length 29 [2024-11-09 07:54:14,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:14,863 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 129 transitions. [2024-11-09 07:54:14,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:54:14,863 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 129 transitions. [2024-11-09 07:54:14,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 07:54:14,863 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:14,863 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:54:14,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 07:54:14,864 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-09 07:54:14,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:14,864 INFO L85 PathProgramCache]: Analyzing trace with hash 14000593, now seen corresponding path program 1 times [2024-11-09 07:54:14,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:14,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975465667] [2024-11-09 07:54:14,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:14,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:14,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:15,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:15,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:15,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:54:15,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:15,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975465667] [2024-11-09 07:54:15,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975465667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:54:15,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:54:15,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:54:15,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648504581] [2024-11-09 07:54:15,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:54:15,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:54:15,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:15,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:54:15,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:54:15,036 INFO L87 Difference]: Start difference. First operand 118 states and 129 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:54:15,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:15,207 INFO L93 Difference]: Finished difference Result 125 states and 137 transitions. [2024-11-09 07:54:15,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:54:15,207 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2024-11-09 07:54:15,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:15,208 INFO L225 Difference]: With dead ends: 125 [2024-11-09 07:54:15,208 INFO L226 Difference]: Without dead ends: 125 [2024-11-09 07:54:15,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:54:15,209 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 22 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:15,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 295 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:54:15,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-09 07:54:15,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 119. [2024-11-09 07:54:15,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 95 states have (on average 1.305263157894737) internal successors, (124), 114 states have internal predecessors, (124), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:54:15,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 130 transitions. [2024-11-09 07:54:15,212 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 130 transitions. Word has length 29 [2024-11-09 07:54:15,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:15,212 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 130 transitions. [2024-11-09 07:54:15,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:54:15,213 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 130 transitions. [2024-11-09 07:54:15,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 07:54:15,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:15,213 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:54:15,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 07:54:15,214 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-09 07:54:15,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:15,214 INFO L85 PathProgramCache]: Analyzing trace with hash 434018507, now seen corresponding path program 1 times [2024-11-09 07:54:15,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:15,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055089542] [2024-11-09 07:54:15,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:15,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:15,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:15,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:15,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:15,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:54:15,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:15,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055089542] [2024-11-09 07:54:15,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055089542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:54:15,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:54:15,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 07:54:15,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273171618] [2024-11-09 07:54:15,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:54:15,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:54:15,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:15,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:54:15,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:54:15,344 INFO L87 Difference]: Start difference. First operand 119 states and 130 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:54:15,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:15,498 INFO L93 Difference]: Finished difference Result 120 states and 131 transitions. [2024-11-09 07:54:15,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:54:15,499 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2024-11-09 07:54:15,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:15,499 INFO L225 Difference]: With dead ends: 120 [2024-11-09 07:54:15,499 INFO L226 Difference]: Without dead ends: 120 [2024-11-09 07:54:15,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:54:15,500 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 16 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:15,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 332 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:54:15,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-09 07:54:15,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-11-09 07:54:15,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 96 states have (on average 1.3020833333333333) internal successors, (125), 115 states have internal predecessors, (125), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:54:15,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 131 transitions. [2024-11-09 07:54:15,503 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 131 transitions. Word has length 30 [2024-11-09 07:54:15,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:15,503 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 131 transitions. [2024-11-09 07:54:15,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:54:15,503 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 131 transitions. [2024-11-09 07:54:15,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 07:54:15,503 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:15,503 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:54:15,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 07:54:15,504 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-09 07:54:15,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:15,504 INFO L85 PathProgramCache]: Analyzing trace with hash 479961838, now seen corresponding path program 1 times [2024-11-09 07:54:15,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:15,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265564686] [2024-11-09 07:54:15,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:15,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:15,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:15,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:15,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:15,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:54:15,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:15,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265564686] [2024-11-09 07:54:15,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265564686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:54:15,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:54:15,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 07:54:15,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31238865] [2024-11-09 07:54:15,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:54:15,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 07:54:15,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:15,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 07:54:15,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:54:15,711 INFO L87 Difference]: Start difference. First operand 120 states and 131 transitions. Second operand has 13 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:54:15,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:15,919 INFO L93 Difference]: Finished difference Result 124 states and 135 transitions. [2024-11-09 07:54:15,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:54:15,920 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2024-11-09 07:54:15,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:15,920 INFO L225 Difference]: With dead ends: 124 [2024-11-09 07:54:15,920 INFO L226 Difference]: Without dead ends: 124 [2024-11-09 07:54:15,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-11-09 07:54:15,921 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 31 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:15,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 307 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:54:15,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-09 07:54:15,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2024-11-09 07:54:15,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 98 states have (on average 1.2959183673469388) internal successors, (127), 117 states have internal predecessors, (127), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:54:15,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 133 transitions. [2024-11-09 07:54:15,924 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 133 transitions. Word has length 32 [2024-11-09 07:54:15,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:15,924 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 133 transitions. [2024-11-09 07:54:15,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:54:15,924 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 133 transitions. [2024-11-09 07:54:15,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 07:54:15,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:15,926 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] [2024-11-09 07:54:15,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-09 07:54:15,926 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-09 07:54:15,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:15,927 INFO L85 PathProgramCache]: Analyzing trace with hash 597065985, now seen corresponding path program 1 times [2024-11-09 07:54:15,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:15,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99322582] [2024-11-09 07:54:15,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:15,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:15,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:16,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:16,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:16,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:54:16,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:16,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99322582] [2024-11-09 07:54:16,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99322582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:54:16,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:54:16,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 07:54:16,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074326566] [2024-11-09 07:54:16,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:54:16,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:54:16,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:16,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:54:16,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:54:16,064 INFO L87 Difference]: Start difference. First operand 122 states and 133 transitions. Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:54:16,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:16,163 INFO L93 Difference]: Finished difference Result 123 states and 134 transitions. [2024-11-09 07:54:16,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:54:16,163 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2024-11-09 07:54:16,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:16,164 INFO L225 Difference]: With dead ends: 123 [2024-11-09 07:54:16,164 INFO L226 Difference]: Without dead ends: 123 [2024-11-09 07:54:16,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:54:16,164 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 26 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:16,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 372 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:54:16,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-09 07:54:16,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-09 07:54:16,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 99 states have (on average 1.292929292929293) internal successors, (128), 118 states have internal predecessors, (128), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:54:16,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 134 transitions. [2024-11-09 07:54:16,166 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 134 transitions. Word has length 35 [2024-11-09 07:54:16,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:16,167 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 134 transitions. [2024-11-09 07:54:16,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:54:16,167 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 134 transitions. [2024-11-09 07:54:16,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 07:54:16,167 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:16,167 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-09 07:54:16,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-09 07:54:16,168 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-09 07:54:16,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:16,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1733330067, now seen corresponding path program 1 times [2024-11-09 07:54:16,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:16,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080208361] [2024-11-09 07:54:16,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:16,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:16,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:16,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:16,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:16,765 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-09 07:54:16,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:16,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080208361] [2024-11-09 07:54:16,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080208361] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:54:16,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737737074] [2024-11-09 07:54:16,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:16,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:54:16,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:54:16,768 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-09 07:54:16,777 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-09 07:54:16,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:16,896 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-09 07:54:16,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:54:16,903 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-09 07:54:16,927 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-09 07:54:16,932 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-09 07:54:16,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-09 07:54:16,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-09 07:54:17,082 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:54:17,082 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-09 07:54:17,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-09 07:54:17,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-09 07:54:17,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:54:17,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:54:17,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-09 07:54:17,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:54:17,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:54:17,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-09 07:54:17,460 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:54:17,461 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 2 case distinctions, treesize of input 24 treesize of output 26 [2024-11-09 07:54:17,473 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:54:17,474 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 3 case distinctions, treesize of input 24 treesize of output 26 [2024-11-09 07:54:17,591 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-09 07:54:17,592 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:54:17,937 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_create_~data~0#1.offset| Int) (v_ArrVal_1382 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~data~0#1.base| v_ArrVal_1382))) (store .cse0 |c_ULTIMATE.start_create_~now~0#1.base| (store (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset| |ULTIMATE.start_create_~data~0#1.offset|))) |c_ULTIMATE.start_create_~dll~0#1.base|) 8) 0)) (forall ((v_ArrVal_1384 Int) (v_ArrVal_1383 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~data~0#1.base| v_ArrVal_1383))) (store .cse1 |c_ULTIMATE.start_create_~now~0#1.base| (store (select .cse1 |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset| v_ArrVal_1384))) |c_ULTIMATE.start_create_~dll~0#1.base|) 8) 0))) is different from false [2024-11-09 07:54:18,275 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_alloc_and_zero_~pi~0.offset 16))) (and (forall ((v_ArrVal_1384 Int) (v_ArrVal_1383 (Array Int Int)) (|v_ULTIMATE.start_create_~now~0#1.offset_21| Int) (|v_ULTIMATE.start_create_~data~0#1.base_14| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_~data~0#1.base_14|) 0)) (= (select (store (select (store (store |c_#memory_$Pointer$#0.base| c_alloc_and_zero_~pi~0.base (store (select |c_#memory_$Pointer$#0.base| c_alloc_and_zero_~pi~0.base) .cse0 0)) |v_ULTIMATE.start_create_~data~0#1.base_14| v_ArrVal_1383) c_alloc_and_zero_~pi~0.base) |v_ULTIMATE.start_create_~now~0#1.offset_21| v_ArrVal_1384) 8) 0) (< c_alloc_and_zero_~pi~0.offset |v_ULTIMATE.start_create_~now~0#1.offset_21|))) (forall ((|ULTIMATE.start_create_~data~0#1.offset| Int) (v_ArrVal_1382 (Array Int Int)) (|v_ULTIMATE.start_create_~now~0#1.offset_21| Int) (|v_ULTIMATE.start_create_~data~0#1.base_14| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_~data~0#1.base_14|) 0)) (= (select (store (select (store (store |c_#memory_$Pointer$#0.offset| c_alloc_and_zero_~pi~0.base (store (select |c_#memory_$Pointer$#0.offset| c_alloc_and_zero_~pi~0.base) .cse0 0)) |v_ULTIMATE.start_create_~data~0#1.base_14| v_ArrVal_1382) c_alloc_and_zero_~pi~0.base) |v_ULTIMATE.start_create_~now~0#1.offset_21| |ULTIMATE.start_create_~data~0#1.offset|) 8) 0) (< c_alloc_and_zero_~pi~0.offset |v_ULTIMATE.start_create_~now~0#1.offset_21|))))) is different from false [2024-11-09 07:54:18,290 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:54:18,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2024-11-09 07:54:18,296 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 48 treesize of output 42 [2024-11-09 07:54:18,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-11-09 07:54:18,314 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:54:18,315 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 40 treesize of output 48 [2024-11-09 07:54:18,391 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:54:18,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2024-11-09 07:54:18,393 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:54:18,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2024-11-09 07:54:18,410 INFO L349 Elim1Store]: treesize reduction 10, result has 47.4 percent of original size [2024-11-09 07:54:18,412 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 34 treesize of output 32 [2024-11-09 07:54:18,475 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-09 07:54:18,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737737074] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:54:18,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:54:18,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 44 [2024-11-09 07:54:18,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71015968] [2024-11-09 07:54:18,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:54:18,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-09 07:54:18,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:18,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-09 07:54:18,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1591, Unknown=4, NotChecked=162, Total=1892 [2024-11-09 07:54:18,478 INFO L87 Difference]: Start difference. First operand 123 states and 134 transitions. Second operand has 44 states, 44 states have (on average 2.1818181818181817) internal successors, (96), 40 states have internal predecessors, (96), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:54:19,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:19,246 INFO L93 Difference]: Finished difference Result 128 states and 139 transitions. [2024-11-09 07:54:19,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 07:54:19,247 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.1818181818181817) internal successors, (96), 40 states have internal predecessors, (96), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2024-11-09 07:54:19,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:19,247 INFO L225 Difference]: With dead ends: 128 [2024-11-09 07:54:19,247 INFO L226 Difference]: Without dead ends: 128 [2024-11-09 07:54:19,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=202, Invalid=2352, Unknown=4, NotChecked=198, Total=2756 [2024-11-09 07:54:19,248 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 17 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 1033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:19,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1127 Invalid, 1033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 911 Invalid, 0 Unknown, 115 Unchecked, 0.5s Time] [2024-11-09 07:54:19,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-09 07:54:19,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-11-09 07:54:19,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 104 states have (on average 1.2788461538461537) internal successors, (133), 123 states have internal predecessors, (133), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:54:19,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 139 transitions. [2024-11-09 07:54:19,251 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 139 transitions. Word has length 38 [2024-11-09 07:54:19,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:19,251 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 139 transitions. [2024-11-09 07:54:19,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.1818181818181817) internal successors, (96), 40 states have internal predecessors, (96), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:54:19,252 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 139 transitions. [2024-11-09 07:54:19,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 07:54:19,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:19,252 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] [2024-11-09 07:54:19,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 07:54:19,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-09 07:54:19,457 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-09 07:54:19,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:19,457 INFO L85 PathProgramCache]: Analyzing trace with hash -2101344200, now seen corresponding path program 1 times [2024-11-09 07:54:19,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:19,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628256769] [2024-11-09 07:54:19,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:19,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:19,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:19,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:19,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:19,894 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-09 07:54:19,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:19,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628256769] [2024-11-09 07:54:19,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628256769] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:54:19,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530067288] [2024-11-09 07:54:19,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:19,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:54:19,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:54:19,897 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-09 07:54:19,898 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-09 07:54:20,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:20,026 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-09 07:54:20,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:54:20,246 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-09 07:54:20,409 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:54:20,410 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 38 treesize of output 30 [2024-11-09 07:54:20,941 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-09 07:54:20,941 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:54:21,216 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 88 treesize of output 80 [2024-11-09 07:54:21,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530067288] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:54:21,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:54:21,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 29 [2024-11-09 07:54:21,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689243498] [2024-11-09 07:54:21,734 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:54:21,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-09 07:54:21,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:21,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-09 07:54:21,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1449, Unknown=2, NotChecked=0, Total=1560 [2024-11-09 07:54:21,735 INFO L87 Difference]: Start difference. First operand 128 states and 139 transitions. Second operand has 30 states, 29 states have (on average 2.4827586206896552) internal successors, (72), 26 states have internal predecessors, (72), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:54:22,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:22,795 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2024-11-09 07:54:22,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 07:54:22,796 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.4827586206896552) internal successors, (72), 26 states have internal predecessors, (72), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2024-11-09 07:54:22,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:22,796 INFO L225 Difference]: With dead ends: 130 [2024-11-09 07:54:22,796 INFO L226 Difference]: Without dead ends: 106 [2024-11-09 07:54:22,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=183, Invalid=2167, Unknown=2, NotChecked=0, Total=2352 [2024-11-09 07:54:22,797 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 25 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:22,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 640 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 906 Invalid, 1 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 07:54:22,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-09 07:54:22,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-09 07:54:22,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 82 states have (on average 1.3414634146341464) internal successors, (110), 101 states have internal predecessors, (110), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:54:22,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2024-11-09 07:54:22,800 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 39 [2024-11-09 07:54:22,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:22,800 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2024-11-09 07:54:22,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.4827586206896552) internal successors, (72), 26 states have internal predecessors, (72), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:54:22,800 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2024-11-09 07:54:22,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 07:54:22,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:22,800 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] [2024-11-09 07:54:22,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 07:54:23,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-09 07:54:23,005 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-09 07:54:23,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:23,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1735997016, now seen corresponding path program 1 times [2024-11-09 07:54:23,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:23,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453972769] [2024-11-09 07:54:23,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:23,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:23,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:23,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:23,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:23,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 07:54:23,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:23,220 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:54:23,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:23,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453972769] [2024-11-09 07:54:23,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453972769] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:54:23,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361003635] [2024-11-09 07:54:23,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:23,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:54:23,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:54:23,222 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-09 07:54:23,223 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-09 07:54:23,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:23,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 07:54:23,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:54:23,450 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 07:54:23,451 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:54:23,571 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:54:23,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2024-11-09 07:54:23,618 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 07:54:23,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361003635] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:54:23,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:54:23,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6] total 20 [2024-11-09 07:54:23,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503702017] [2024-11-09 07:54:23,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:54:23,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 07:54:23,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:23,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 07:54:23,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2024-11-09 07:54:23,620 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand has 21 states, 20 states have (on average 4.25) internal successors, (85), 19 states have internal predecessors, (85), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-09 07:54:23,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:23,782 INFO L93 Difference]: Finished difference Result 107 states and 117 transitions. [2024-11-09 07:54:23,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 07:54:23,783 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 4.25) internal successors, (85), 19 states have internal predecessors, (85), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2024-11-09 07:54:23,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:23,783 INFO L225 Difference]: With dead ends: 107 [2024-11-09 07:54:23,784 INFO L226 Difference]: Without dead ends: 107 [2024-11-09 07:54:23,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2024-11-09 07:54:23,784 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 7 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:23,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 645 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:54:23,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-09 07:54:23,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2024-11-09 07:54:23,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 82 states have (on average 1.329268292682927) internal successors, (109), 101 states have internal predecessors, (109), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:54:23,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 115 transitions. [2024-11-09 07:54:23,787 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 115 transitions. Word has length 41 [2024-11-09 07:54:23,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:23,787 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 115 transitions. [2024-11-09 07:54:23,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 4.25) internal successors, (85), 19 states have internal predecessors, (85), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-09 07:54:23,787 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2024-11-09 07:54:23,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 07:54:23,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:23,788 INFO L215 NwaCegarLoop]: trace histogram [3, 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-09 07:54:23,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 07:54:23,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-09 07:54:23,992 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-09 07:54:23,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:23,992 INFO L85 PathProgramCache]: Analyzing trace with hash 147897274, now seen corresponding path program 1 times [2024-11-09 07:54:23,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:23,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582803313] [2024-11-09 07:54:23,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:23,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:24,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:24,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:24,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:24,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 07:54:24,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:24,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 07:54:24,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:24,327 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 07:54:24,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:24,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582803313] [2024-11-09 07:54:24,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582803313] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:54:24,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278322622] [2024-11-09 07:54:24,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:24,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:54:24,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:54:24,329 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-09 07:54:24,330 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-09 07:54:24,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:24,478 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 07:54:24,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:54:24,520 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:54:24,520 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-09 07:54:24,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 07:54:24,574 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 07:54:24,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-09 07:54:24,608 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 07:54:24,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-09 07:54:24,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-09 07:54:24,633 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base (select |c_#valid| alloc_and_zero_~pi~0.base))))) is different from true [2024-11-09 07:54:24,658 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 07:54:24,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-09 07:54:24,660 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 5 not checked. [2024-11-09 07:54:24,660 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:54:24,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278322622] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:54:24,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:54:24,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 21 [2024-11-09 07:54:24,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656910555] [2024-11-09 07:54:24,702 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:54:24,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 07:54:24,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:24,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 07:54:24,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=402, Unknown=1, NotChecked=40, Total=506 [2024-11-09 07:54:24,703 INFO L87 Difference]: Start difference. First operand 106 states and 115 transitions. Second operand has 22 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 18 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 07:54:24,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:24,985 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2024-11-09 07:54:24,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 07:54:24,986 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 18 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 42 [2024-11-09 07:54:24,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:24,986 INFO L225 Difference]: With dead ends: 104 [2024-11-09 07:54:24,986 INFO L226 Difference]: Without dead ends: 104 [2024-11-09 07:54:24,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=652, Unknown=1, NotChecked=52, Total=812 [2024-11-09 07:54:24,987 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 12 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:24,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 545 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 441 Invalid, 0 Unknown, 64 Unchecked, 0.2s Time] [2024-11-09 07:54:24,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-09 07:54:24,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-09 07:54:24,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 82 states have (on average 1.3048780487804879) internal successors, (107), 99 states have internal predecessors, (107), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:54:24,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2024-11-09 07:54:24,989 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 42 [2024-11-09 07:54:24,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:24,990 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2024-11-09 07:54:24,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 18 states have internal predecessors, (53), 2 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 07:54:24,990 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2024-11-09 07:54:24,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 07:54:24,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:24,990 INFO L215 NwaCegarLoop]: trace histogram [3, 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-09 07:54:25,003 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-09 07:54:25,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:54:25,191 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-09 07:54:25,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:25,191 INFO L85 PathProgramCache]: Analyzing trace with hash 147897275, now seen corresponding path program 1 times [2024-11-09 07:54:25,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:25,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678438991] [2024-11-09 07:54:25,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:25,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:25,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:25,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:25,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:25,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 07:54:25,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:25,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 07:54:25,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:25,702 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 07:54:25,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:25,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678438991] [2024-11-09 07:54:25,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678438991] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:54:25,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182715444] [2024-11-09 07:54:25,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:25,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:54:25,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:54:25,703 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-09 07:54:25,704 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-09 07:54:25,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:25,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-09 07:54:25,837 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:54:25,861 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-09 07:54:25,904 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:54:25,905 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-09 07:54:25,927 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-09 07:54:25,930 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-09 07:54:25,993 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 07:54:25,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-09 07:54:26,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 07:54:26,080 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 07:54:26,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2024-11-09 07:54:26,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 07:54:26,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 18 [2024-11-09 07:54:26,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-09 07:54:26,163 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2024-11-09 07:54:26,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:54:26,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 07:54:26,189 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:54:26,189 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-09 07:54:26,208 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-09 07:54:26,208 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:54:26,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182715444] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:54:26,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:54:26,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 29 [2024-11-09 07:54:26,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354132251] [2024-11-09 07:54:26,279 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:54:26,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-09 07:54:26,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:26,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-09 07:54:26,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=835, Unknown=1, NotChecked=58, Total=992 [2024-11-09 07:54:26,280 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. Second operand has 30 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 23 states have internal predecessors, (60), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-09 07:54:26,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:26,730 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2024-11-09 07:54:26,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 07:54:26,730 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 23 states have internal predecessors, (60), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 42 [2024-11-09 07:54:26,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:26,731 INFO L225 Difference]: With dead ends: 100 [2024-11-09 07:54:26,731 INFO L226 Difference]: Without dead ends: 100 [2024-11-09 07:54:26,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=194, Invalid=1369, Unknown=1, NotChecked=76, Total=1640 [2024-11-09 07:54:26,732 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 48 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 73 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:26,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 620 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 553 Invalid, 0 Unknown, 73 Unchecked, 0.3s Time] [2024-11-09 07:54:26,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-09 07:54:26,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-09 07:54:26,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 95 states have internal predecessors, (103), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:54:26,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2024-11-09 07:54:26,733 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 42 [2024-11-09 07:54:26,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:26,734 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2024-11-09 07:54:26,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 23 states have internal predecessors, (60), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-09 07:54:26,734 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2024-11-09 07:54:26,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 07:54:26,735 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:26,735 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] [2024-11-09 07:54:26,754 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-09 07:54:26,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2024-11-09 07:54:26,935 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-09 07:54:26,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:26,936 INFO L85 PathProgramCache]: Analyzing trace with hash 124992976, now seen corresponding path program 1 times [2024-11-09 07:54:26,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:26,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110165016] [2024-11-09 07:54:26,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:26,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:26,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:27,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:27,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:27,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 07:54:27,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:27,347 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:54:27,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:27,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110165016] [2024-11-09 07:54:27,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110165016] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:54:27,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506597132] [2024-11-09 07:54:27,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:27,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:54:27,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:54:27,349 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-09 07:54:27,350 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-09 07:54:27,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:27,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-11-09 07:54:27,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:54:27,578 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-09 07:54:27,721 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:54:27,722 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-09 07:54:27,729 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-09 07:54:27,762 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-09 07:54:27,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:54:27,771 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-09 07:54:27,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:54:27,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 40 [2024-11-09 07:54:27,892 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 37 treesize of output 18 [2024-11-09 07:54:27,913 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-09 07:54:27,949 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 25 treesize of output 18 [2024-11-09 07:54:28,091 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:54:28,091 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:54:28,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506597132] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:54:28,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:54:28,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 34 [2024-11-09 07:54:28,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052384926] [2024-11-09 07:54:28,696 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:54:28,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-09 07:54:28,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:28,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-09 07:54:28,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1804, Unknown=11, NotChecked=0, Total=1980 [2024-11-09 07:54:28,698 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand has 35 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 30 states have internal predecessors, (83), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:54:29,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:29,175 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2024-11-09 07:54:29,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 07:54:29,176 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 30 states have internal predecessors, (83), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 47 [2024-11-09 07:54:29,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:29,176 INFO L225 Difference]: With dead ends: 112 [2024-11-09 07:54:29,176 INFO L226 Difference]: Without dead ends: 112 [2024-11-09 07:54:29,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 596 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=265, Invalid=2586, Unknown=11, NotChecked=0, Total=2862 [2024-11-09 07:54:29,178 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 55 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:29,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 718 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:54:29,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-09 07:54:29,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 101. [2024-11-09 07:54:29,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 83 states have (on average 1.2530120481927711) internal successors, (104), 96 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:54:29,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2024-11-09 07:54:29,180 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 47 [2024-11-09 07:54:29,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:29,180 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2024-11-09 07:54:29,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 30 states have internal predecessors, (83), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:54:29,181 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2024-11-09 07:54:29,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 07:54:29,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:29,181 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:54:29,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-09 07:54:29,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:54:29,382 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-09 07:54:29,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:29,382 INFO L85 PathProgramCache]: Analyzing trace with hash 126439857, now seen corresponding path program 1 times [2024-11-09 07:54:29,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:29,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568257960] [2024-11-09 07:54:29,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:29,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:29,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:29,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:29,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:29,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 07:54:29,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:29,911 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:54:29,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:29,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568257960] [2024-11-09 07:54:29,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568257960] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:54:29,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953027762] [2024-11-09 07:54:29,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:29,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:54:29,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:54:29,914 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-09 07:54:29,916 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-09 07:54:30,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:30,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-09 07:54:30,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:54:30,248 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:54:30,248 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-09 07:54:30,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 07:54:30,290 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-09 07:54:30,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-09 07:54:30,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:54:30,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 37 [2024-11-09 07:54:30,463 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 07:54:30,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-09 07:54:30,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 07:54:30,617 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:54:30,617 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:54:30,771 INFO L349 Elim1Store]: treesize reduction 5, result has 88.4 percent of original size [2024-11-09 07:54:30,771 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 47 treesize of output 46 [2024-11-09 07:54:30,906 INFO L349 Elim1Store]: treesize reduction 19, result has 69.4 percent of original size [2024-11-09 07:54:30,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 102 [2024-11-09 07:54:30,925 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:54:30,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 155 treesize of output 162 [2024-11-09 07:54:30,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 84 [2024-11-09 07:54:31,070 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:54:31,071 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 67 treesize of output 67 [2024-11-09 07:54:31,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953027762] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:54:31,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:54:31,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 37 [2024-11-09 07:54:31,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108606042] [2024-11-09 07:54:31,216 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:54:31,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-09 07:54:31,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:31,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-09 07:54:31,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1994, Unknown=8, NotChecked=0, Total=2162 [2024-11-09 07:54:31,218 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 38 states, 37 states have (on average 2.108108108108108) internal successors, (78), 32 states have internal predecessors, (78), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:54:31,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:31,706 INFO L93 Difference]: Finished difference Result 108 states and 120 transitions. [2024-11-09 07:54:31,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 07:54:31,706 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.108108108108108) internal successors, (78), 32 states have internal predecessors, (78), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 47 [2024-11-09 07:54:31,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:31,707 INFO L225 Difference]: With dead ends: 108 [2024-11-09 07:54:31,707 INFO L226 Difference]: Without dead ends: 108 [2024-11-09 07:54:31,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=257, Invalid=2815, Unknown=8, NotChecked=0, Total=3080 [2024-11-09 07:54:31,708 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 19 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:31,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 905 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:54:31,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-09 07:54:31,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2024-11-09 07:54:31,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 89 states have (on average 1.2584269662921348) internal successors, (112), 102 states have internal predecessors, (112), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:54:31,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 118 transitions. [2024-11-09 07:54:31,710 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 118 transitions. Word has length 47 [2024-11-09 07:54:31,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:31,711 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 118 transitions. [2024-11-09 07:54:31,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.108108108108108) internal successors, (78), 32 states have internal predecessors, (78), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:54:31,711 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2024-11-09 07:54:31,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 07:54:31,711 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:31,711 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:54:31,726 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-09 07:54:31,911 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,SelfDestructingSolverStorable32 [2024-11-09 07:54:31,912 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-09 07:54:31,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:31,912 INFO L85 PathProgramCache]: Analyzing trace with hash 126439858, now seen corresponding path program 1 times [2024-11-09 07:54:31,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:31,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954115778] [2024-11-09 07:54:31,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:31,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:31,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:32,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:32,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:32,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 07:54:32,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:32,549 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:54:32,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:32,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954115778] [2024-11-09 07:54:32,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954115778] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:54:32,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844340682] [2024-11-09 07:54:32,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:32,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:54:32,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:54:32,552 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-09 07:54:32,553 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-09 07:54:32,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:32,742 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 80 conjuncts are in the unsatisfiable core [2024-11-09 07:54:32,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:54:32,841 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-09 07:54:32,895 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:54:32,895 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-09 07:54:32,939 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-09 07:54:32,945 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-09 07:54:33,043 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 07:54:33,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 07:54:33,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 07:54:33,109 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 07:54:33,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 07:54:33,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 07:54:33,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 07:54:33,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 07:54:33,299 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:54:33,300 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:54:33,722 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:54:33,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 47 [2024-11-09 07:54:33,727 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:54:33,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2024-11-09 07:54:33,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 52 [2024-11-09 07:54:33,746 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:54:33,746 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 220 treesize of output 207 [2024-11-09 07:54:33,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 70 [2024-11-09 07:54:33,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 62 [2024-11-09 07:54:33,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 80 [2024-11-09 07:54:33,821 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 07:54:33,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 1 [2024-11-09 07:54:33,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844340682] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:54:33,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:54:33,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 37 [2024-11-09 07:54:33,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749831044] [2024-11-09 07:54:33,959 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:54:33,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-09 07:54:33,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:33,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-09 07:54:33,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=2260, Unknown=4, NotChecked=0, Total=2450 [2024-11-09 07:54:33,960 INFO L87 Difference]: Start difference. First operand 107 states and 118 transitions. Second operand has 38 states, 37 states have (on average 2.27027027027027) internal successors, (84), 32 states have internal predecessors, (84), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:54:34,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:34,407 INFO L93 Difference]: Finished difference Result 108 states and 119 transitions. [2024-11-09 07:54:34,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 07:54:34,408 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.27027027027027) internal successors, (84), 32 states have internal predecessors, (84), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 47 [2024-11-09 07:54:34,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:34,408 INFO L225 Difference]: With dead ends: 108 [2024-11-09 07:54:34,408 INFO L226 Difference]: Without dead ends: 108 [2024-11-09 07:54:34,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 932 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=261, Invalid=2815, Unknown=4, NotChecked=0, Total=3080 [2024-11-09 07:54:34,409 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 24 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:34,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 988 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:54:34,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-09 07:54:34,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2024-11-09 07:54:34,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 89 states have (on average 1.247191011235955) internal successors, (111), 102 states have internal predecessors, (111), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:54:34,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 117 transitions. [2024-11-09 07:54:34,411 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 117 transitions. Word has length 47 [2024-11-09 07:54:34,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:34,411 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 117 transitions. [2024-11-09 07:54:34,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.27027027027027) internal successors, (84), 32 states have internal predecessors, (84), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:54:34,412 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 117 transitions. [2024-11-09 07:54:34,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-09 07:54:34,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:34,412 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:54:34,425 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-09 07:54:34,612 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,SelfDestructingSolverStorable33 [2024-11-09 07:54:34,612 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-09 07:54:34,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:34,613 INFO L85 PathProgramCache]: Analyzing trace with hash -767519134, now seen corresponding path program 1 times [2024-11-09 07:54:34,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:34,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590293823] [2024-11-09 07:54:34,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:34,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:34,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:35,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:35,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:35,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 07:54:35,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:35,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-09 07:54:35,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:35,181 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 07:54:35,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:35,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590293823] [2024-11-09 07:54:35,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590293823] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:54:35,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036638324] [2024-11-09 07:54:35,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:35,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:54:35,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:54:35,188 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-09 07:54:35,190 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-09 07:54:35,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:35,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-09 07:54:35,364 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:54:35,514 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:54:35,515 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-09 07:54:35,537 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-09 07:54:35,541 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-09 07:54:35,567 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-09 07:54:35,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:54:35,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 32 [2024-11-09 07:54:35,674 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 07:54:35,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-09 07:54:35,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-09 07:54:35,717 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-09 07:54:35,775 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:54:35,775 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-09 07:54:35,803 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-09 07:54:35,806 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-09 07:54:35,870 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 07:54:35,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 07:54:35,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 07:54:35,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-09 07:54:35,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-09 07:54:35,914 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:54:35,915 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:54:36,044 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2729 (Array Int Int)) (v_ArrVal_2728 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2728) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2729) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)))) (forall ((v_ArrVal_2728 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2728) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)))))) is different from false [2024-11-09 07:54:36,052 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:54:36,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2024-11-09 07:54:36,055 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:54:36,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2024-11-09 07:54:36,061 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 62 treesize of output 50 [2024-11-09 07:54:36,063 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 96 treesize of output 78 [2024-11-09 07:54:36,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-09 07:54:36,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:54:36,074 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:54:36,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-11-09 07:54:36,076 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:54:36,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-09 07:54:36,336 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-09 07:54:36,336 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 22 treesize of output 21 [2024-11-09 07:54:36,339 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2722 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem10#1.base| v_ArrVal_2722) |c_ULTIMATE.start_create_~now~0#1.base|) (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|)) |c_ULTIMATE.start_create_#t~mem10#1.base|)) is different from false [2024-11-09 07:54:36,446 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2722 (Array Int Int)) (v_ArrVal_2720 Int) (|v_ULTIMATE.start_create_#t~mem9#1.offset_30| Int)) (let ((.cse2 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (or (let ((.cse0 (let ((.cse3 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))) (store |c_#memory_$Pointer$#0.base| .cse3 (store (select |c_#memory_$Pointer$#0.base| .cse3) (+ 16 |v_ULTIMATE.start_create_#t~mem9#1.offset_30|) v_ArrVal_2720))))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_2722) |c_ULTIMATE.start_create_~now~0#1.base|) .cse2) .cse1))) (< |v_ULTIMATE.start_create_#t~mem9#1.offset_30| (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))))) is different from false [2024-11-09 07:54:36,467 INFO L349 Elim1Store]: treesize reduction 31, result has 50.0 percent of original size [2024-11-09 07:54:36,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 90 [2024-11-09 07:54:36,481 INFO L349 Elim1Store]: treesize reduction 3, result has 76.9 percent of original size [2024-11-09 07:54:36,481 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 119 treesize of output 93 [2024-11-09 07:54:36,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-09 07:54:36,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2024-11-09 07:54:36,598 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 3 not checked. [2024-11-09 07:54:36,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036638324] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:54:36,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:54:36,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23, 19] total 56 [2024-11-09 07:54:36,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267485946] [2024-11-09 07:54:36,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:54:36,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-11-09 07:54:36,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:36,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-11-09 07:54:36,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=2635, Unknown=40, NotChecked=318, Total=3192 [2024-11-09 07:54:36,601 INFO L87 Difference]: Start difference. First operand 107 states and 117 transitions. Second operand has 57 states, 56 states have (on average 1.9285714285714286) internal successors, (108), 47 states have internal predecessors, (108), 4 states have call successors, (6), 4 states have call predecessors, (6), 8 states have return successors, (8), 8 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-09 07:54:37,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:37,310 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2024-11-09 07:54:37,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 07:54:37,311 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 1.9285714285714286) internal successors, (108), 47 states have internal predecessors, (108), 4 states have call successors, (6), 4 states have call predecessors, (6), 8 states have return successors, (8), 8 states have call predecessors, (8), 4 states have call successors, (8) Word has length 48 [2024-11-09 07:54:37,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:37,311 INFO L225 Difference]: With dead ends: 106 [2024-11-09 07:54:37,311 INFO L226 Difference]: Without dead ends: 106 [2024-11-09 07:54:37,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 958 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=354, Invalid=3650, Unknown=40, NotChecked=378, Total=4422 [2024-11-09 07:54:37,312 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 59 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 1315 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 120 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:37,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 1315 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 710 Invalid, 0 Unknown, 120 Unchecked, 0.4s Time] [2024-11-09 07:54:37,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-09 07:54:37,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-09 07:54:37,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.2359550561797752) internal successors, (110), 101 states have internal predecessors, (110), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:54:37,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2024-11-09 07:54:37,314 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 48 [2024-11-09 07:54:37,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:37,314 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2024-11-09 07:54:37,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 1.9285714285714286) internal successors, (108), 47 states have internal predecessors, (108), 4 states have call successors, (6), 4 states have call predecessors, (6), 8 states have return successors, (8), 8 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-09 07:54:37,315 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2024-11-09 07:54:37,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-09 07:54:37,315 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:37,315 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] [2024-11-09 07:54:37,329 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-09 07:54:37,515 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,SelfDestructingSolverStorable34 [2024-11-09 07:54:37,516 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-09 07:54:37,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:37,516 INFO L85 PathProgramCache]: Analyzing trace with hash -420184918, now seen corresponding path program 1 times [2024-11-09 07:54:37,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:37,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598207602] [2024-11-09 07:54:37,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:37,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:37,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:37,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:37,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:37,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 07:54:37,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:37,951 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:54:37,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:37,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598207602] [2024-11-09 07:54:37,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598207602] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:54:37,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837700258] [2024-11-09 07:54:37,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:37,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:54:37,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:54:37,954 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-09 07:54:37,955 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-09 07:54:38,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:38,128 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-11-09 07:54:38,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:54:38,195 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-09 07:54:38,232 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 9 treesize of output 5 [2024-11-09 07:54:38,323 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:54:38,323 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-09 07:54:38,328 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 18 treesize of output 13 [2024-11-09 07:54:38,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:54:38,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-09 07:54:38,368 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-09 07:54:38,411 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-09 07:54:38,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:54:38,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:54:38,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:54:38,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 44 [2024-11-09 07:54:38,519 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 07:54:38,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2024-11-09 07:54:38,655 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:54:38,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 07:54:38,658 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:54:38,659 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:54:39,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837700258] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:54:39,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:54:39,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 35 [2024-11-09 07:54:39,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645868534] [2024-11-09 07:54:39,077 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:54:39,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-09 07:54:39,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:39,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-09 07:54:39,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1881, Unknown=16, NotChecked=0, Total=2070 [2024-11-09 07:54:39,078 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand has 36 states, 35 states have (on average 2.4) internal successors, (84), 31 states have internal predecessors, (84), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:54:39,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:39,599 INFO L93 Difference]: Finished difference Result 116 states and 126 transitions. [2024-11-09 07:54:39,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 07:54:39,599 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.4) internal successors, (84), 31 states have internal predecessors, (84), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 48 [2024-11-09 07:54:39,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:39,600 INFO L225 Difference]: With dead ends: 116 [2024-11-09 07:54:39,600 INFO L226 Difference]: Without dead ends: 116 [2024-11-09 07:54:39,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 789 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=276, Invalid=2678, Unknown=16, NotChecked=0, Total=2970 [2024-11-09 07:54:39,602 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 43 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:39,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 701 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:54:39,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-09 07:54:39,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 107. [2024-11-09 07:54:39,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 90 states have (on average 1.2333333333333334) internal successors, (111), 102 states have internal predecessors, (111), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:54:39,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 117 transitions. [2024-11-09 07:54:39,606 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 117 transitions. Word has length 48 [2024-11-09 07:54:39,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:39,606 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 117 transitions. [2024-11-09 07:54:39,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.4) internal successors, (84), 31 states have internal predecessors, (84), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:54:39,606 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 117 transitions. [2024-11-09 07:54:39,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 07:54:39,606 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:39,607 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-09 07:54:39,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-09 07:54:39,808 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,SelfDestructingSolverStorable35 [2024-11-09 07:54:39,808 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-09 07:54:39,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:39,808 INFO L85 PathProgramCache]: Analyzing trace with hash -140830446, now seen corresponding path program 1 times [2024-11-09 07:54:39,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:39,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096569801] [2024-11-09 07:54:39,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:39,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:39,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:40,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:40,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:40,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 07:54:40,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:40,299 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:54:40,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:40,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096569801] [2024-11-09 07:54:40,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096569801] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:54:40,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815255450] [2024-11-09 07:54:40,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:40,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:54:40,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:54:40,302 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-09 07:54:40,303 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-09 07:54:40,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:40,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-09 07:54:40,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:54:40,629 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:54:40,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:54:40,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 07:54:40,731 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 07:54:40,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 40 [2024-11-09 07:54:40,792 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 07:54:40,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 40 [2024-11-09 07:54:40,985 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:54:40,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2024-11-09 07:54:41,036 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:54:41,036 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:54:41,478 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|)))) (and (forall ((|v_ULTIMATE.start_loop_~l#1.offset_21| Int) (v_ArrVal_3047 (Array Int Int))) (or (< |v_ULTIMATE.start_loop_~l#1.offset_21| 0) (= |v_ULTIMATE.start_loop_~l#1.offset_21| 0) (< |c_ULTIMATE.start_create_~dll~0#1.offset| |v_ULTIMATE.start_loop_~l#1.offset_21|) (not (= (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_3047) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |v_ULTIMATE.start_loop_~l#1.offset_21| 8)) 0)))) (or (forall ((|v_ULTIMATE.start_loop_~l#1.offset_21| Int) (v_ArrVal_3047 (Array Int Int))) (or (< |v_ULTIMATE.start_loop_~l#1.offset_21| 0) (< |c_ULTIMATE.start_create_~dll~0#1.offset| |v_ULTIMATE.start_loop_~l#1.offset_21|) (not (= (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_3047) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |v_ULTIMATE.start_loop_~l#1.offset_21| 8)) 0)))) (= |c_ULTIMATE.start_create_~dll~0#1.base| 0)))) is different from false [2024-11-09 07:54:41,619 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) (and (or (= |c_ULTIMATE.start_create_~dll~0#1.base| 0) (forall ((|v_ULTIMATE.start_loop_~l#1.offset_21| Int) (v_ArrVal_3046 (Array Int Int)) (v_ArrVal_3047 (Array Int Int))) (or (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_3046))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_3047)) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |v_ULTIMATE.start_loop_~l#1.offset_21| 8)) 0)) (< |v_ULTIMATE.start_loop_~l#1.offset_21| 0) (< |c_ULTIMATE.start_create_~dll~0#1.offset| |v_ULTIMATE.start_loop_~l#1.offset_21|)))) (forall ((|v_ULTIMATE.start_loop_~l#1.offset_21| Int) (v_ArrVal_3046 (Array Int Int)) (v_ArrVal_3047 (Array Int Int))) (or (not (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$#0.base| .cse2 v_ArrVal_3046))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) v_ArrVal_3047)) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |v_ULTIMATE.start_loop_~l#1.offset_21| 8)) 0)) (< |v_ULTIMATE.start_loop_~l#1.offset_21| 0) (= |v_ULTIMATE.start_loop_~l#1.offset_21| 0) (< |c_ULTIMATE.start_create_~dll~0#1.offset| |v_ULTIMATE.start_loop_~l#1.offset_21|)))))) is different from false [2024-11-09 07:54:41,656 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:54:41,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 36 [2024-11-09 07:54:41,670 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:54:41,671 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 167 treesize of output 142 [2024-11-09 07:54:41,680 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:54:41,680 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 90 treesize of output 79 [2024-11-09 07:54:41,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 62 [2024-11-09 07:54:41,738 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:54:41,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 36 [2024-11-09 07:54:41,747 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:54:41,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 167 treesize of output 142 [2024-11-09 07:54:41,757 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:54:41,757 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 90 treesize of output 79 [2024-11-09 07:54:41,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 62 [2024-11-09 07:54:42,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815255450] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:54:42,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:54:42,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21] total 38 [2024-11-09 07:54:42,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934779223] [2024-11-09 07:54:42,043 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:54:42,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-09 07:54:42,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:54:42,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-09 07:54:42,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=2373, Unknown=17, NotChecked=198, Total=2756 [2024-11-09 07:54:42,044 INFO L87 Difference]: Start difference. First operand 107 states and 117 transitions. Second operand has 38 states, 38 states have (on average 2.3157894736842106) internal successors, (88), 33 states have internal predecessors, (88), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:54:42,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:54:42,841 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2024-11-09 07:54:42,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-09 07:54:42,841 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.3157894736842106) internal successors, (88), 33 states have internal predecessors, (88), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 49 [2024-11-09 07:54:42,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:54:42,842 INFO L225 Difference]: With dead ends: 111 [2024-11-09 07:54:42,842 INFO L226 Difference]: Without dead ends: 111 [2024-11-09 07:54:42,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=325, Invalid=4220, Unknown=19, NotChecked=266, Total=4830 [2024-11-09 07:54:42,843 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 32 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:54:42,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 899 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:54:42,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-09 07:54:42,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 108. [2024-11-09 07:54:42,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.2197802197802199) internal successors, (111), 103 states have internal predecessors, (111), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:54:42,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2024-11-09 07:54:42,845 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 49 [2024-11-09 07:54:42,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:54:42,846 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2024-11-09 07:54:42,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.3157894736842106) internal successors, (88), 33 states have internal predecessors, (88), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:54:42,846 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2024-11-09 07:54:42,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 07:54:42,846 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:54:42,846 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:54:42,860 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-09 07:54:43,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:54:43,047 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-09 07:54:43,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:54:43,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1019871627, now seen corresponding path program 2 times [2024-11-09 07:54:43,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:54:43,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759533257] [2024-11-09 07:54:43,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:54:43,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:54:43,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:43,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:54:43,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:43,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 07:54:43,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:54:43,998 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:54:43,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:54:43,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759533257] [2024-11-09 07:54:43,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759533257] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:54:43,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165275372] [2024-11-09 07:54:43,999 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:54:43,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:54:43,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:54:44,000 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-09 07:54:44,001 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-09 07:54:44,191 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 07:54:44,191 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:54:44,194 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 101 conjuncts are in the unsatisfiable core [2024-11-09 07:54:44,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:54:44,238 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-09 07:54:44,240 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-09 07:54:44,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-09 07:54:44,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-09 07:54:44,318 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:54:44,318 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-09 07:54:44,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2024-11-09 07:54:44,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2024-11-09 07:54:44,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:54:44,498 INFO L349 Elim1Store]: treesize reduction 27, result has 28.9 percent of original size [2024-11-09 07:54:44,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 105 treesize of output 81 [2024-11-09 07:54:44,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:54:44,510 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2024-11-09 07:54:44,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 52 [2024-11-09 07:54:44,631 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 07:54:44,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 65 [2024-11-09 07:54:44,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 39 [2024-11-09 07:54:44,949 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:54:44,949 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:55:01,469 INFO L349 Elim1Store]: treesize reduction 432, result has 29.9 percent of original size [2024-11-09 07:55:01,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 20 new quantified variables, introduced 56 case distinctions, treesize of input 320911 treesize of output 225274 [2024-11-09 07:55:05,496 INFO L349 Elim1Store]: treesize reduction 1393, result has 24.0 percent of original size [2024-11-09 07:55:05,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 18 new quantified variables, introduced 67 case distinctions, treesize of input 143201 treesize of output 122003 [2024-11-09 07:55:08,509 INFO L349 Elim1Store]: treesize reduction 68, result has 82.9 percent of original size [2024-11-09 07:55:08,510 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 17 new quantified variables, introduced 45 case distinctions, treesize of input 199390 treesize of output 161526 [2024-11-09 07:55:21,091 WARN L286 SmtUtils]: Spent 9.86s on a formula simplification. DAG size of input: 466 DAG size of output: 168 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-09 07:55:21,091 INFO L349 Elim1Store]: treesize reduction 1760, result has 25.8 percent of original size [2024-11-09 07:55:21,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 18 new quantified variables, introduced 92 case distinctions, treesize of input 369015863 treesize of output 194656156 [2024-11-09 07:55:28,108 WARN L286 SmtUtils]: Spent 6.97s on a formula simplification. DAG size of input: 14958 DAG size of output: 1625 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 07:55:29,116 INFO L224 Elim1Store]: Index analysis took 131 ms