./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-fst-shared.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-fst-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 b71f005f6b63440309c4e24d3866ac559942cc4e42efba34dd3f9c28733bd7e5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:52:05,414 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:52:05,486 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-10-13 10:52:05,493 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:52:05,493 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:52:05,518 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:52:05,519 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:52:05,520 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:52:05,520 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:52:05,520 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:52:05,521 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:52:05,536 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:52:05,538 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:52:05,539 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:52:05,539 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:52:05,539 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:52:05,539 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:52:05,540 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:52:05,540 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:52:05,540 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:52:05,540 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 10:52:05,545 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:52:05,546 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:52:05,546 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:52:05,546 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:52:05,546 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:52:05,547 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:52:05,547 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:52:05,547 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:52:05,548 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:52:05,548 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:52:05,548 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:52:05,549 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:52:05,549 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 10:52:05,549 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 10:52:05,550 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:52:05,550 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:52:05,550 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:52:05,550 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:52:05,550 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 -> b71f005f6b63440309c4e24d3866ac559942cc4e42efba34dd3f9c28733bd7e5 [2024-10-13 10:52:05,805 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:52:05,832 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:52:05,835 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:52:05,836 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:52:05,837 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:52:05,838 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-fst-shared.i [2024-10-13 10:52:07,292 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:52:07,578 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:52:07,579 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-fst-shared.i [2024-10-13 10:52:07,608 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e30a3c46/a595b7ac9b234934a9afa30107c9f1ee/FLAG515fb307a [2024-10-13 10:52:07,621 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e30a3c46/a595b7ac9b234934a9afa30107c9f1ee [2024-10-13 10:52:07,623 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:52:07,625 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:52:07,626 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:52:07,626 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:52:07,633 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:52:07,634 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:52:07" (1/1) ... [2024-10-13 10:52:07,635 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fe8afe4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:52:07, skipping insertion in model container [2024-10-13 10:52:07,636 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:52:07" (1/1) ... [2024-10-13 10:52:07,685 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:52:08,024 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:52:08,035 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 10:52:08,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:52:08,177 INFO L204 MainTranslator]: Completed translation [2024-10-13 10:52:08,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:52:08 WrapperNode [2024-10-13 10:52:08,177 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:52:08,178 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 10:52:08,179 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 10:52:08,179 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 10:52:08,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:52:08" (1/1) ... [2024-10-13 10:52:08,208 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:52:08" (1/1) ... [2024-10-13 10:52:08,235 INFO L138 Inliner]: procedures = 121, calls = 23, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 74 [2024-10-13 10:52:08,236 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 10:52:08,237 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 10:52:08,237 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 10:52:08,237 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 10:52:08,247 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:52:08" (1/1) ... [2024-10-13 10:52:08,247 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:52:08" (1/1) ... [2024-10-13 10:52:08,250 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:52:08" (1/1) ... [2024-10-13 10:52:08,266 INFO L175 MemorySlicer]: Split 11 memory accesses to 1 slices as follows [11]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 5 writes are split as follows [5]. [2024-10-13 10:52:08,267 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:52:08" (1/1) ... [2024-10-13 10:52:08,267 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:52:08" (1/1) ... [2024-10-13 10:52:08,276 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:52:08" (1/1) ... [2024-10-13 10:52:08,279 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:52:08" (1/1) ... [2024-10-13 10:52:08,281 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:52:08" (1/1) ... [2024-10-13 10:52:08,282 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:52:08" (1/1) ... [2024-10-13 10:52:08,284 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 10:52:08,285 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 10:52:08,285 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 10:52:08,286 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 10:52:08,286 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:52:08" (1/1) ... [2024-10-13 10:52:08,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:52:08,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:52:08,324 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 10:52:08,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 10:52:08,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 10:52:08,381 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2024-10-13 10:52:08,382 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2024-10-13 10:52:08,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 10:52:08,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 10:52:08,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 10:52:08,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 10:52:08,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 10:52:08,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 10:52:08,477 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 10:52:08,480 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 10:52:08,732 INFO L? ?]: Removed 77 outVars from TransFormulas that were not future-live. [2024-10-13 10:52:08,732 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 10:52:08,773 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 10:52:08,774 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-13 10:52:08,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:52:08 BoogieIcfgContainer [2024-10-13 10:52:08,774 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 10:52:08,777 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 10:52:08,778 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 10:52:08,782 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 10:52:08,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:52:07" (1/3) ... [2024-10-13 10:52:08,783 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d69841f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:52:08, skipping insertion in model container [2024-10-13 10:52:08,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:52:08" (2/3) ... [2024-10-13 10:52:08,783 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d69841f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:52:08, skipping insertion in model container [2024-10-13 10:52:08,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:52:08" (3/3) ... [2024-10-13 10:52:08,785 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-fst-shared.i [2024-10-13 10:52:08,803 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 10:52:08,803 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2024-10-13 10:52:08,857 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 10:52:08,866 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;@651c0d11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 10:52:08,867 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2024-10-13 10:52:08,871 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 58 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:52:08,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-13 10:52:08,876 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:52:08,876 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-13 10:52:08,877 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-10-13 10:52:08,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:52:08,881 INFO L85 PathProgramCache]: Analyzing trace with hash 4876116, now seen corresponding path program 1 times [2024-10-13 10:52:08,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:52:08,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231775275] [2024-10-13 10:52:08,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:08,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:52:08,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:09,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:52:09,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:52:09,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231775275] [2024-10-13 10:52:09,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231775275] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:52:09,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:52:09,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:52:09,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419661333] [2024-10-13 10:52:09,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:52:09,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:52:09,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:52:09,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:52:09,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:52:09,157 INFO L87 Difference]: Start difference. First operand has 62 states, 29 states have (on average 2.2413793103448274) internal successors, (65), 58 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:52:09,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:52:09,245 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2024-10-13 10:52:09,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:52:09,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-13 10:52:09,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:52:09,255 INFO L225 Difference]: With dead ends: 61 [2024-10-13 10:52:09,255 INFO L226 Difference]: Without dead ends: 60 [2024-10-13 10:52:09,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:52:09,262 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:52:09,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:52:09,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-13 10:52:09,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-10-13 10:52:09,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 56 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:52:09,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2024-10-13 10:52:09,302 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 4 [2024-10-13 10:52:09,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:52:09,303 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2024-10-13 10:52:09,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:52:09,303 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2024-10-13 10:52:09,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-13 10:52:09,304 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:52:09,304 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-13 10:52:09,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 10:52:09,304 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-10-13 10:52:09,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:52:09,306 INFO L85 PathProgramCache]: Analyzing trace with hash 4876117, now seen corresponding path program 1 times [2024-10-13 10:52:09,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:52:09,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139226870] [2024-10-13 10:52:09,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:09,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:52:09,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:09,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:52:09,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:52:09,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139226870] [2024-10-13 10:52:09,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139226870] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:52:09,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:52:09,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:52:09,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707339321] [2024-10-13 10:52:09,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:52:09,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:52:09,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:52:09,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:52:09,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:52:09,418 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:52:09,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:52:09,482 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2024-10-13 10:52:09,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:52:09,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-13 10:52:09,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:52:09,484 INFO L225 Difference]: With dead ends: 59 [2024-10-13 10:52:09,484 INFO L226 Difference]: Without dead ends: 59 [2024-10-13 10:52:09,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:52:09,485 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:52:09,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:52:09,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-13 10:52:09,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-10-13 10:52:09,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 55 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:52:09,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2024-10-13 10:52:09,496 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 4 [2024-10-13 10:52:09,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:52:09,496 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2024-10-13 10:52:09,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:52:09,497 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2024-10-13 10:52:09,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-13 10:52:09,497 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:52:09,497 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:52:09,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 10:52:09,498 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-10-13 10:52:09,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:52:09,499 INFO L85 PathProgramCache]: Analyzing trace with hash -760919924, now seen corresponding path program 1 times [2024-10-13 10:52:09,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:52:09,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481259590] [2024-10-13 10:52:09,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:09,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:52:09,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:09,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:52:09,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:09,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:52:09,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:52:09,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481259590] [2024-10-13 10:52:09,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481259590] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:52:09,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:52:09,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:52:09,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17555680] [2024-10-13 10:52:09,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:52:09,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:52:09,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:52:09,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:52:09,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:52:09,668 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:52:09,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:52:09,771 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2024-10-13 10:52:09,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:52:09,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 7 [2024-10-13 10:52:09,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:52:09,774 INFO L225 Difference]: With dead ends: 62 [2024-10-13 10:52:09,774 INFO L226 Difference]: Without dead ends: 62 [2024-10-13 10:52:09,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:52:09,777 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 7 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:52:09,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 98 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:52:09,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-13 10:52:09,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2024-10-13 10:52:09,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 29 states have (on average 2.0) internal successors, (58), 54 states have internal predecessors, (58), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:52:09,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2024-10-13 10:52:09,790 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 7 [2024-10-13 10:52:09,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:52:09,790 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2024-10-13 10:52:09,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:52:09,791 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2024-10-13 10:52:09,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-13 10:52:09,791 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:52:09,791 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:52:09,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 10:52:09,792 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-10-13 10:52:09,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:52:09,793 INFO L85 PathProgramCache]: Analyzing trace with hash -760919923, now seen corresponding path program 1 times [2024-10-13 10:52:09,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:52:09,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876641425] [2024-10-13 10:52:09,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:09,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:52:09,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:09,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:52:09,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:09,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:52:09,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:52:09,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876641425] [2024-10-13 10:52:09,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876641425] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:52:09,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:52:09,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:52:09,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823907655] [2024-10-13 10:52:09,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:52:09,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:52:09,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:52:09,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:52:09,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:52:09,922 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:52:10,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:52:10,024 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2024-10-13 10:52:10,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:52:10,025 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 7 [2024-10-13 10:52:10,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:52:10,026 INFO L225 Difference]: With dead ends: 61 [2024-10-13 10:52:10,026 INFO L226 Difference]: Without dead ends: 61 [2024-10-13 10:52:10,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:52:10,029 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 7 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:52:10,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 103 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:52:10,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-13 10:52:10,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2024-10-13 10:52:10,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 53 states have internal predecessors, (57), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:52:10,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2024-10-13 10:52:10,038 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 7 [2024-10-13 10:52:10,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:52:10,038 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2024-10-13 10:52:10,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:52:10,038 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2024-10-13 10:52:10,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-13 10:52:10,039 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:52:10,039 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:52:10,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 10:52:10,039 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-10-13 10:52:10,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:52:10,040 INFO L85 PathProgramCache]: Analyzing trace with hash -2113677552, now seen corresponding path program 1 times [2024-10-13 10:52:10,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:52:10,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345432357] [2024-10-13 10:52:10,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:10,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:52:10,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:10,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:52:10,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:10,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:52:10,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:52:10,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345432357] [2024-10-13 10:52:10,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345432357] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:52:10,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:52:10,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 10:52:10,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192018961] [2024-10-13 10:52:10,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:52:10,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:52:10,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:52:10,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:52:10,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:52:10,250 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 7 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:52:10,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:52:10,392 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2024-10-13 10:52:10,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:52:10,393 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2024-10-13 10:52:10,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:52:10,394 INFO L225 Difference]: With dead ends: 58 [2024-10-13 10:52:10,394 INFO L226 Difference]: Without dead ends: 58 [2024-10-13 10:52:10,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:52:10,395 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 8 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:52:10,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 159 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:52:10,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-13 10:52:10,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2024-10-13 10:52:10,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 50 states have internal predecessors, (54), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:52:10,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2024-10-13 10:52:10,406 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 8 [2024-10-13 10:52:10,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:52:10,406 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2024-10-13 10:52:10,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:52:10,407 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2024-10-13 10:52:10,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-13 10:52:10,407 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:52:10,407 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:52:10,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 10:52:10,408 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-10-13 10:52:10,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:52:10,408 INFO L85 PathProgramCache]: Analyzing trace with hash -2113677551, now seen corresponding path program 1 times [2024-10-13 10:52:10,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:52:10,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468759978] [2024-10-13 10:52:10,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:10,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:52:10,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:10,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:52:10,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:10,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:52:10,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:52:10,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468759978] [2024-10-13 10:52:10,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468759978] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:52:10,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:52:10,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 10:52:10,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634314833] [2024-10-13 10:52:10,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:52:10,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:52:10,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:52:10,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:52:10,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:52:10,736 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 7 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:52:10,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:52:10,871 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2024-10-13 10:52:10,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:52:10,871 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2024-10-13 10:52:10,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:52:10,873 INFO L225 Difference]: With dead ends: 57 [2024-10-13 10:52:10,873 INFO L226 Difference]: Without dead ends: 57 [2024-10-13 10:52:10,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:52:10,875 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 4 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:52:10,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 164 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:52:10,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-10-13 10:52:10,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2024-10-13 10:52:10,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 49 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:52:10,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2024-10-13 10:52:10,883 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 8 [2024-10-13 10:52:10,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:52:10,883 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2024-10-13 10:52:10,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:52:10,886 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2024-10-13 10:52:10,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-13 10:52:10,887 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:52:10,887 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:52:10,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 10:52:10,888 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-10-13 10:52:10,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:52:10,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1151762607, now seen corresponding path program 1 times [2024-10-13 10:52:10,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:52:10,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276173527] [2024-10-13 10:52:10,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:10,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:52:10,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:10,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:52:10,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:10,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:52:10,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:52:10,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276173527] [2024-10-13 10:52:10,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276173527] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:52:10,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:52:10,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:52:10,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461923129] [2024-10-13 10:52:10,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:52:10,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:52:10,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:52:10,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:52:10,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:52:10,999 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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-10-13 10:52:11,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:52:11,123 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2024-10-13 10:52:11,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:52:11,124 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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-10-13 10:52:11,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:52:11,125 INFO L225 Difference]: With dead ends: 70 [2024-10-13 10:52:11,125 INFO L226 Difference]: Without dead ends: 70 [2024-10-13 10:52:11,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:52:11,126 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 19 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:52:11,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 132 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:52:11,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-13 10:52:11,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2024-10-13 10:52:11,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 40 states have (on average 1.825) internal successors, (73), 59 states have internal predecessors, (73), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 10:52:11,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2024-10-13 10:52:11,136 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 13 [2024-10-13 10:52:11,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:52:11,137 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2024-10-13 10:52:11,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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-10-13 10:52:11,137 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2024-10-13 10:52:11,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-13 10:52:11,137 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:52:11,137 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:52:11,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 10:52:11,138 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-10-13 10:52:11,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:52:11,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1151762608, now seen corresponding path program 1 times [2024-10-13 10:52:11,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:52:11,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830075814] [2024-10-13 10:52:11,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:11,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:52:11,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:11,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:52:11,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:11,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:52:11,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:52:11,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830075814] [2024-10-13 10:52:11,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830075814] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:52:11,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:52:11,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 10:52:11,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912005213] [2024-10-13 10:52:11,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:52:11,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 10:52:11,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:52:11,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 10:52:11,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-13 10:52:11,383 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand has 9 states, 7 states have (on average 1.5714285714285714) 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-10-13 10:52:11,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:52:11,549 INFO L93 Difference]: Finished difference Result 70 states and 84 transitions. [2024-10-13 10:52:11,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 10:52:11,550 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.5714285714285714) 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-10-13 10:52:11,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:52:11,550 INFO L225 Difference]: With dead ends: 70 [2024-10-13 10:52:11,552 INFO L226 Difference]: Without dead ends: 70 [2024-10-13 10:52:11,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:52:11,553 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 11 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:52:11,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 253 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:52:11,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-13 10:52:11,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2024-10-13 10:52:11,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 44 states have (on average 1.7727272727272727) internal successors, (78), 63 states have internal predecessors, (78), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 10:52:11,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 84 transitions. [2024-10-13 10:52:11,561 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 84 transitions. Word has length 13 [2024-10-13 10:52:11,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:52:11,562 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 84 transitions. [2024-10-13 10:52:11,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.5714285714285714) 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-10-13 10:52:11,564 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 84 transitions. [2024-10-13 10:52:11,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-13 10:52:11,565 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:52:11,565 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:52:11,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 10:52:11,565 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-10-13 10:52:11,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:52:11,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1212264992, now seen corresponding path program 1 times [2024-10-13 10:52:11,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:52:11,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797785688] [2024-10-13 10:52:11,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:11,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:52:11,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:11,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:52:11,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:11,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 10:52:11,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:11,741 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:52:11,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:52:11,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797785688] [2024-10-13 10:52:11,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797785688] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:52:11,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:52:11,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:52:11,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95530642] [2024-10-13 10:52:11,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:52:11,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:52:11,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:52:11,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:52:11,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:52:11,747 INFO L87 Difference]: Start difference. First operand 68 states and 84 transitions. Second operand has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:52:11,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:52:11,849 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2024-10-13 10:52:11,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:52:11,850 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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 15 [2024-10-13 10:52:11,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:52:11,851 INFO L225 Difference]: With dead ends: 68 [2024-10-13 10:52:11,851 INFO L226 Difference]: Without dead ends: 68 [2024-10-13 10:52:11,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:52:11,852 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 6 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:52:11,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 106 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:52:11,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-13 10:52:11,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-10-13 10:52:11,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 44 states have (on average 1.75) internal successors, (77), 63 states have internal predecessors, (77), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 10:52:11,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 83 transitions. [2024-10-13 10:52:11,856 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 83 transitions. Word has length 15 [2024-10-13 10:52:11,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:52:11,856 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 83 transitions. [2024-10-13 10:52:11,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:52:11,856 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 83 transitions. [2024-10-13 10:52:11,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-13 10:52:11,857 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:52:11,857 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:52:11,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 10:52:11,857 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-10-13 10:52:11,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:52:11,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1212264991, now seen corresponding path program 1 times [2024-10-13 10:52:11,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:52:11,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325374591] [2024-10-13 10:52:11,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:11,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:52:11,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:12,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:52:12,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:12,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 10:52:12,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:12,172 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:52:12,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:52:12,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325374591] [2024-10-13 10:52:12,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325374591] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:52:12,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257185493] [2024-10-13 10:52:12,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:12,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:52:12,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:52:12,176 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:52:12,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 10:52:12,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:12,268 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-13 10:52:12,273 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:52:12,470 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2024-10-13 10:52:12,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:52:12,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-13 10:52:12,536 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:52:12,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-13 10:52:12,561 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-13 10:52:12,561 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:52:12,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257185493] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:52:12,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:52:12,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2024-10-13 10:52:12,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3834161] [2024-10-13 10:52:12,697 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:52:12,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-13 10:52:12,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:52:12,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-13 10:52:12,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=319, Unknown=1, NotChecked=36, Total=420 [2024-10-13 10:52:12,699 INFO L87 Difference]: Start difference. First operand 68 states and 83 transitions. Second operand has 19 states, 15 states have (on average 1.4) internal successors, (21), 13 states have internal predecessors, (21), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 10:52:12,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:52:12,896 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2024-10-13 10:52:12,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:52:12,896 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 1.4) internal successors, (21), 13 states have internal predecessors, (21), 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 15 [2024-10-13 10:52:12,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:52:12,897 INFO L225 Difference]: With dead ends: 70 [2024-10-13 10:52:12,897 INFO L226 Difference]: Without dead ends: 70 [2024-10-13 10:52:12,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=424, Unknown=1, NotChecked=42, Total=552 [2024-10-13 10:52:12,898 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 32 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:52:12,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 280 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 176 Invalid, 0 Unknown, 66 Unchecked, 0.1s Time] [2024-10-13 10:52:12,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-13 10:52:12,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2024-10-13 10:52:12,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 44 states have (on average 1.6818181818181819) internal successors, (74), 63 states have internal predecessors, (74), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 10:52:12,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 80 transitions. [2024-10-13 10:52:12,902 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 80 transitions. Word has length 15 [2024-10-13 10:52:12,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:52:12,902 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 80 transitions. [2024-10-13 10:52:12,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 1.4) internal successors, (21), 13 states have internal predecessors, (21), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 10:52:12,902 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 80 transitions. [2024-10-13 10:52:12,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-13 10:52:12,903 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:52:12,903 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:52:12,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 10:52:13,107 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,SelfDestructingSolverStorable9 [2024-10-13 10:52:13,108 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-10-13 10:52:13,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:52:13,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1257742689, now seen corresponding path program 1 times [2024-10-13 10:52:13,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:52:13,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591098858] [2024-10-13 10:52:13,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:13,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:52:13,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:13,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:52:13,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:13,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:52:13,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:52:13,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591098858] [2024-10-13 10:52:13,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591098858] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:52:13,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:52:13,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 10:52:13,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079228875] [2024-10-13 10:52:13,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:52:13,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:52:13,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:52:13,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:52:13,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:52:13,206 INFO L87 Difference]: Start difference. First operand 68 states and 80 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:52:13,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:52:13,330 INFO L93 Difference]: Finished difference Result 71 states and 84 transitions. [2024-10-13 10:52:13,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 10:52:13,331 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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 15 [2024-10-13 10:52:13,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:52:13,332 INFO L225 Difference]: With dead ends: 71 [2024-10-13 10:52:13,332 INFO L226 Difference]: Without dead ends: 71 [2024-10-13 10:52:13,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:52:13,333 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 13 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:52:13,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 260 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:52:13,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-13 10:52:13,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2024-10-13 10:52:13,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 45 states have (on average 1.6222222222222222) internal successors, (73), 64 states have internal predecessors, (73), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 10:52:13,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2024-10-13 10:52:13,337 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 15 [2024-10-13 10:52:13,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:52:13,337 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2024-10-13 10:52:13,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:52:13,337 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2024-10-13 10:52:13,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-13 10:52:13,338 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:52:13,338 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:52:13,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 10:52:13,339 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-10-13 10:52:13,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:52:13,339 INFO L85 PathProgramCache]: Analyzing trace with hash -331815379, now seen corresponding path program 1 times [2024-10-13 10:52:13,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:52:13,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46334835] [2024-10-13 10:52:13,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:13,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:52:13,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:13,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:52:13,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:13,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:52:13,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:52:13,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46334835] [2024-10-13 10:52:13,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46334835] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:52:13,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957087336] [2024-10-13 10:52:13,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:13,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:52:13,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:52:13,767 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:52:13,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 10:52:13,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:13,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-10-13 10:52:13,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:52:13,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 10:52:13,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 10:52:13,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 10:52:14,005 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:52:14,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-13 10:52:14,057 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-10-13 10:52:14,068 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-10-13 10:52:14,146 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-10-13 10:52:14,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 17 [2024-10-13 10:52:14,164 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-10-13 10:52:14,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 17 [2024-10-13 10:52:14,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:52:14,298 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:52:15,163 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:52:15,164 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 63 treesize of output 64 [2024-10-13 10:52:15,175 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:52:15,176 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 55 treesize of output 56 [2024-10-13 10:52:15,187 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:52:15,188 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 67 treesize of output 67 [2024-10-13 10:52:15,196 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 52 [2024-10-13 10:52:15,208 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:52:15,208 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 72 treesize of output 72 [2024-10-13 10:52:15,219 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 59 treesize of output 57 [2024-10-13 10:52:15,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:52:15,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957087336] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:52:15,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:52:15,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 25 [2024-10-13 10:52:15,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511193152] [2024-10-13 10:52:15,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:52:15,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-13 10:52:15,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:52:15,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-13 10:52:15,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=517, Unknown=13, NotChecked=0, Total=600 [2024-10-13 10:52:15,435 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand has 25 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 21 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:52:15,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:52:15,902 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2024-10-13 10:52:15,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:52:15,902 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 21 states have internal predecessors, (36), 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 16 [2024-10-13 10:52:15,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:52:15,903 INFO L225 Difference]: With dead ends: 70 [2024-10-13 10:52:15,903 INFO L226 Difference]: Without dead ends: 70 [2024-10-13 10:52:15,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=96, Invalid=647, Unknown=13, NotChecked=0, Total=756 [2024-10-13 10:52:15,904 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 13 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:52:15,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 512 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:52:15,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-13 10:52:15,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-10-13 10:52:15,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 46 states have (on average 1.608695652173913) internal successors, (74), 65 states have internal predecessors, (74), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 10:52:15,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2024-10-13 10:52:15,908 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 16 [2024-10-13 10:52:15,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:52:15,909 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2024-10-13 10:52:15,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 21 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:52:15,909 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2024-10-13 10:52:15,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-13 10:52:15,910 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:52:15,910 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:52:15,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 10:52:16,114 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,SelfDestructingSolverStorable11 [2024-10-13 10:52:16,115 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-10-13 10:52:16,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:52:16,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1050422936, now seen corresponding path program 1 times [2024-10-13 10:52:16,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:52:16,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198962924] [2024-10-13 10:52:16,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:16,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:52:16,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:16,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:52:16,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:16,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 10:52:16,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:16,233 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 10:52:16,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:52:16,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198962924] [2024-10-13 10:52:16,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198962924] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:52:16,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:52:16,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 10:52:16,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135999147] [2024-10-13 10:52:16,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:52:16,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:52:16,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:52:16,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:52:16,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:52:16,235 INFO L87 Difference]: Start difference. First operand 70 states and 80 transitions. Second operand has 7 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:52:16,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:52:16,344 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2024-10-13 10:52:16,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:52:16,345 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 17 [2024-10-13 10:52:16,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:52:16,345 INFO L225 Difference]: With dead ends: 69 [2024-10-13 10:52:16,345 INFO L226 Difference]: Without dead ends: 69 [2024-10-13 10:52:16,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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-10-13 10:52:16,347 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 4 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:52:16,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 164 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:52:16,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-13 10:52:16,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-10-13 10:52:16,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 46 states have (on average 1.565217391304348) internal successors, (72), 64 states have internal predecessors, (72), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 10:52:16,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2024-10-13 10:52:16,352 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 17 [2024-10-13 10:52:16,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:52:16,352 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2024-10-13 10:52:16,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:52:16,356 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2024-10-13 10:52:16,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-13 10:52:16,356 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:52:16,357 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:52:16,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 10:52:16,357 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-10-13 10:52:16,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:52:16,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1050422935, now seen corresponding path program 1 times [2024-10-13 10:52:16,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:52:16,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937759221] [2024-10-13 10:52:16,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:16,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:52:16,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:16,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:52:16,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:16,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 10:52:16,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:16,570 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:52:16,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:52:16,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937759221] [2024-10-13 10:52:16,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937759221] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:52:16,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:52:16,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 10:52:16,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364713136] [2024-10-13 10:52:16,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:52:16,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:52:16,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:52:16,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:52:16,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:52:16,574 INFO L87 Difference]: Start difference. First operand 69 states and 78 transitions. Second operand has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:52:16,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:52:16,697 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2024-10-13 10:52:16,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 10:52:16,697 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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 17 [2024-10-13 10:52:16,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:52:16,698 INFO L225 Difference]: With dead ends: 68 [2024-10-13 10:52:16,698 INFO L226 Difference]: Without dead ends: 68 [2024-10-13 10:52:16,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-13 10:52:16,699 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 3 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:52:16,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 207 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:52:16,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-13 10:52:16,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-10-13 10:52:16,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 63 states have internal predecessors, (70), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 10:52:16,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2024-10-13 10:52:16,705 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 17 [2024-10-13 10:52:16,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:52:16,706 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2024-10-13 10:52:16,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:52:16,706 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2024-10-13 10:52:16,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-13 10:52:16,706 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:52:16,707 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:52:16,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 10:52:16,707 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-10-13 10:52:16,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:52:16,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1047044963, now seen corresponding path program 1 times [2024-10-13 10:52:16,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:52:16,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992525735] [2024-10-13 10:52:16,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:16,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:52:16,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:16,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:52:16,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:16,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:52:16,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:52:16,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992525735] [2024-10-13 10:52:16,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992525735] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:52:16,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065513499] [2024-10-13 10:52:16,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:16,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:52:16,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:52:16,801 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:52:16,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 10:52:16,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:16,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 10:52:16,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:52:16,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:52:16,905 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:52:16,922 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-13 10:52:16,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2024-10-13 10:52:16,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:52:16,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065513499] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:52:16,931 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:52:16,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 6 [2024-10-13 10:52:16,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902623574] [2024-10-13 10:52:16,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:52:16,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:52:16,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:52:16,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:52:16,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:52:16,932 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:52:17,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:52:17,058 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2024-10-13 10:52:17,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:52:17,059 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-10-13 10:52:17,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:52:17,060 INFO L225 Difference]: With dead ends: 72 [2024-10-13 10:52:17,060 INFO L226 Difference]: Without dead ends: 72 [2024-10-13 10:52:17,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:52:17,061 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 18 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:52:17,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 110 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:52:17,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-13 10:52:17,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2024-10-13 10:52:17,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 48 states have (on average 1.5) internal successors, (72), 63 states have internal predecessors, (72), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 10:52:17,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2024-10-13 10:52:17,070 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 18 [2024-10-13 10:52:17,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:52:17,070 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2024-10-13 10:52:17,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:52:17,070 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2024-10-13 10:52:17,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-13 10:52:17,071 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:52:17,071 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:52:17,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-13 10:52:17,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:52:17,276 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-10-13 10:52:17,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:52:17,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1047044962, now seen corresponding path program 1 times [2024-10-13 10:52:17,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:52:17,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143291408] [2024-10-13 10:52:17,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:17,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:52:17,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:17,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:52:17,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:17,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:52:17,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:52:17,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143291408] [2024-10-13 10:52:17,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143291408] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:52:17,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215138654] [2024-10-13 10:52:17,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:17,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:52:17,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:52:17,454 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:52:17,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 10:52:17,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:17,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-13 10:52:17,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:52:17,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:52:17,606 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:52:17,685 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:52:17,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2024-10-13 10:52:17,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:52:17,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215138654] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:52:17,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:52:17,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2024-10-13 10:52:17,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260625929] [2024-10-13 10:52:17,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:52:17,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-13 10:52:17,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:52:17,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-13 10:52:17,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2024-10-13 10:52:17,822 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 21 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 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-10-13 10:52:18,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:52:18,086 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2024-10-13 10:52:18,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 10:52:18,087 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 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 18 [2024-10-13 10:52:18,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:52:18,087 INFO L225 Difference]: With dead ends: 74 [2024-10-13 10:52:18,088 INFO L226 Difference]: Without dead ends: 74 [2024-10-13 10:52:18,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2024-10-13 10:52:18,088 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 25 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:52:18,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 383 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:52:18,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-13 10:52:18,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2024-10-13 10:52:18,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 53 states have (on average 1.490566037735849) internal successors, (79), 67 states have internal predecessors, (79), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 10:52:18,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 85 transitions. [2024-10-13 10:52:18,093 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 85 transitions. Word has length 18 [2024-10-13 10:52:18,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:52:18,093 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 85 transitions. [2024-10-13 10:52:18,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 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-10-13 10:52:18,093 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 85 transitions. [2024-10-13 10:52:18,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-13 10:52:18,095 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:52:18,095 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:52:18,112 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-13 10:52:18,295 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,SelfDestructingSolverStorable15 [2024-10-13 10:52:18,296 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-10-13 10:52:18,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:52:18,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1901344563, now seen corresponding path program 1 times [2024-10-13 10:52:18,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:52:18,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887739022] [2024-10-13 10:52:18,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:18,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:52:18,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:18,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:52:18,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:18,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:52:18,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:52:18,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887739022] [2024-10-13 10:52:18,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887739022] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:52:18,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:52:18,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 10:52:18,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332368805] [2024-10-13 10:52:18,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:52:18,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 10:52:18,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:52:18,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 10:52:18,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-13 10:52:18,540 INFO L87 Difference]: Start difference. First operand 72 states and 85 transitions. Second operand has 11 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 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-10-13 10:52:18,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:52:18,725 INFO L93 Difference]: Finished difference Result 85 states and 102 transitions. [2024-10-13 10:52:18,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 10:52:18,725 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 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-10-13 10:52:18,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:52:18,727 INFO L225 Difference]: With dead ends: 85 [2024-10-13 10:52:18,727 INFO L226 Difference]: Without dead ends: 85 [2024-10-13 10:52:18,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-13 10:52:18,727 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 17 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:52:18,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 250 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:52:18,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-13 10:52:18,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 76. [2024-10-13 10:52:18,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 71 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 10:52:18,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 90 transitions. [2024-10-13 10:52:18,731 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 90 transitions. Word has length 19 [2024-10-13 10:52:18,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:52:18,731 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 90 transitions. [2024-10-13 10:52:18,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 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-10-13 10:52:18,732 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 90 transitions. [2024-10-13 10:52:18,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-13 10:52:18,732 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:52:18,732 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:52:18,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 10:52:18,733 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-10-13 10:52:18,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:52:18,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1187515612, now seen corresponding path program 1 times [2024-10-13 10:52:18,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:52:18,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063318827] [2024-10-13 10:52:18,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:18,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:52:18,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:18,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:52:18,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:18,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:52:18,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:52:18,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063318827] [2024-10-13 10:52:18,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063318827] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:52:18,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:52:18,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 10:52:18,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791218803] [2024-10-13 10:52:18,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:52:18,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 10:52:18,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:52:18,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 10:52:18,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-13 10:52:18,824 INFO L87 Difference]: Start difference. First operand 76 states and 90 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:52:18,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:52:18,925 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2024-10-13 10:52:18,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 10:52:18,925 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-10-13 10:52:18,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:52:18,926 INFO L225 Difference]: With dead ends: 76 [2024-10-13 10:52:18,927 INFO L226 Difference]: Without dead ends: 76 [2024-10-13 10:52:18,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-13 10:52:18,927 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 24 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:52:18,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 200 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:52:18,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-13 10:52:18,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2024-10-13 10:52:18,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 69 states have internal predecessors, (78), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 10:52:18,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2024-10-13 10:52:18,931 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 20 [2024-10-13 10:52:18,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:52:18,932 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2024-10-13 10:52:18,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:52:18,932 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2024-10-13 10:52:18,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-13 10:52:18,933 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:52:18,933 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:52:18,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 10:52:18,937 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-10-13 10:52:18,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:52:18,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1187860579, now seen corresponding path program 1 times [2024-10-13 10:52:18,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:52:18,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935369954] [2024-10-13 10:52:18,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:18,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:52:18,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:19,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:52:19,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:19,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:52:19,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:52:19,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935369954] [2024-10-13 10:52:19,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935369954] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:52:19,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:52:19,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 10:52:19,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891917636] [2024-10-13 10:52:19,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:52:19,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 10:52:19,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:52:19,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 10:52:19,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-13 10:52:19,250 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand has 11 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:52:19,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:52:19,454 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2024-10-13 10:52:19,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 10:52:19,455 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-10-13 10:52:19,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:52:19,455 INFO L225 Difference]: With dead ends: 80 [2024-10-13 10:52:19,456 INFO L226 Difference]: Without dead ends: 80 [2024-10-13 10:52:19,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-13 10:52:19,456 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 16 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:52:19,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 223 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:52:19,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-13 10:52:19,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2024-10-13 10:52:19,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 70 states have internal predecessors, (79), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 10:52:19,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2024-10-13 10:52:19,460 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 20 [2024-10-13 10:52:19,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:52:19,460 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2024-10-13 10:52:19,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:52:19,460 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2024-10-13 10:52:19,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-13 10:52:19,461 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:52:19,461 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:52:19,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 10:52:19,462 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-10-13 10:52:19,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:52:19,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1831027829, now seen corresponding path program 1 times [2024-10-13 10:52:19,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:52:19,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974437775] [2024-10-13 10:52:19,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:19,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:52:19,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:19,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:52:19,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:19,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:52:19,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:52:19,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974437775] [2024-10-13 10:52:19,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974437775] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:52:19,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:52:19,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 10:52:19,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420633829] [2024-10-13 10:52:19,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:52:19,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 10:52:19,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:52:19,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 10:52:19,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-10-13 10:52:19,690 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand has 12 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:52:19,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:52:19,877 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2024-10-13 10:52:19,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 10:52:19,878 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-10-13 10:52:19,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:52:19,879 INFO L225 Difference]: With dead ends: 76 [2024-10-13 10:52:19,879 INFO L226 Difference]: Without dead ends: 76 [2024-10-13 10:52:19,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-10-13 10:52:19,880 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 11 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 273 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.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:52:19,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 273 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:52:19,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-13 10:52:19,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-10-13 10:52:19,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 71 states have internal predecessors, (80), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 10:52:19,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2024-10-13 10:52:19,887 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 21 [2024-10-13 10:52:19,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:52:19,888 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2024-10-13 10:52:19,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:52:19,888 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2024-10-13 10:52:19,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-13 10:52:19,888 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:52:19,888 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:52:19,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 10:52:19,889 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-10-13 10:52:19,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:52:19,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1859673922, now seen corresponding path program 1 times [2024-10-13 10:52:19,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:52:19,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990246613] [2024-10-13 10:52:19,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:19,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:52:19,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:20,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:52:20,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:20,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 10:52:20,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:20,233 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:52:20,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:52:20,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990246613] [2024-10-13 10:52:20,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990246613] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:52:20,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079601704] [2024-10-13 10:52:20,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:20,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:52:20,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:52:20,236 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-10-13 10:52:20,237 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-10-13 10:52:20,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:20,353 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-10-13 10:52:20,356 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:52:20,532 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-13 10:52:20,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-10-13 10:52:20,547 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:52:20,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-13 10:52:20,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 10:52:20,627 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 8 treesize of output 4 [2024-10-13 10:52:20,687 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:52:20,687 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:52:20,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079601704] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:52:20,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:52:20,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2024-10-13 10:52:20,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802758231] [2024-10-13 10:52:20,840 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:52:20,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-13 10:52:20,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:52:20,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-13 10:52:20,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=613, Unknown=0, NotChecked=0, Total=702 [2024-10-13 10:52:20,841 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand has 24 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 10:52:21,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:52:21,107 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2024-10-13 10:52:21,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 10:52:21,107 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 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 23 [2024-10-13 10:52:21,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:52:21,108 INFO L225 Difference]: With dead ends: 78 [2024-10-13 10:52:21,108 INFO L226 Difference]: Without dead ends: 78 [2024-10-13 10:52:21,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=808, Unknown=0, NotChecked=0, Total=930 [2024-10-13 10:52:21,109 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 9 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:52:21,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 343 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:52:21,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-13 10:52:21,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2024-10-13 10:52:21,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 71 states have internal predecessors, (79), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 10:52:21,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2024-10-13 10:52:21,112 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 23 [2024-10-13 10:52:21,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:52:21,113 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2024-10-13 10:52:21,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 10:52:21,113 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2024-10-13 10:52:21,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-13 10:52:21,114 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:52:21,114 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:52:21,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-13 10:52:21,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:52:21,319 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-10-13 10:52:21,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:52:21,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1318843688, now seen corresponding path program 1 times [2024-10-13 10:52:21,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:52:21,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13052959] [2024-10-13 10:52:21,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:21,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:52:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:21,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:52:21,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:21,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:52:21,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:52:21,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13052959] [2024-10-13 10:52:21,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13052959] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:52:21,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:52:21,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-13 10:52:21,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776789489] [2024-10-13 10:52:21,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:52:21,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 10:52:21,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:52:21,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 10:52:21,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-10-13 10:52:21,686 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:52:21,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:52:21,918 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2024-10-13 10:52:21,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 10:52:21,918 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-10-13 10:52:21,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:52:21,919 INFO L225 Difference]: With dead ends: 79 [2024-10-13 10:52:21,919 INFO L226 Difference]: Without dead ends: 79 [2024-10-13 10:52:21,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-10-13 10:52:21,920 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 22 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:52:21,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 186 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:52:21,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-13 10:52:21,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2024-10-13 10:52:21,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 73 states have internal predecessors, (81), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 10:52:21,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2024-10-13 10:52:21,922 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 23 [2024-10-13 10:52:21,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:52:21,922 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2024-10-13 10:52:21,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:52:21,922 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2024-10-13 10:52:21,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-13 10:52:21,923 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:52:21,923 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:52:21,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-13 10:52:21,923 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-10-13 10:52:21,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:52:21,923 INFO L85 PathProgramCache]: Analyzing trace with hash -394812818, now seen corresponding path program 1 times [2024-10-13 10:52:21,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:52:21,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146023385] [2024-10-13 10:52:21,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:21,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:52:21,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:22,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:52:22,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:22,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 10:52:22,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:22,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 10:52:22,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:22,256 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 10:52:22,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:52:22,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146023385] [2024-10-13 10:52:22,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146023385] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:52:22,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085466632] [2024-10-13 10:52:22,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:22,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:52:22,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:52:22,258 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-10-13 10:52:22,259 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-10-13 10:52:22,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:22,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-13 10:52:22,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:52:22,416 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:52:22,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-13 10:52:22,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 10:52:22,474 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 10:52:22,477 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 34 treesize of output 33 [2024-10-13 10:52:22,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-13 10:52:22,497 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base (select |c_#valid| alloc_and_zero_~pi~0.base))))) is different from true [2024-10-13 10:52:22,518 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-13 10:52:22,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-13 10:52:22,521 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2024-10-13 10:52:22,521 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:52:22,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085466632] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:52:22,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:52:22,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 17 [2024-10-13 10:52:22,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931793474] [2024-10-13 10:52:22,566 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:52:22,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-13 10:52:22,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:52:22,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-13 10:52:22,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=262, Unknown=1, NotChecked=32, Total=342 [2024-10-13 10:52:22,567 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand has 18 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 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-10-13 10:52:22,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:52:22,796 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2024-10-13 10:52:22,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 10:52:22,796 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 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 25 [2024-10-13 10:52:22,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:52:22,797 INFO L225 Difference]: With dead ends: 77 [2024-10-13 10:52:22,797 INFO L226 Difference]: Without dead ends: 77 [2024-10-13 10:52:22,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=390, Unknown=1, NotChecked=40, Total=506 [2024-10-13 10:52:22,798 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 5 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:52:22,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 303 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 260 Invalid, 0 Unknown, 47 Unchecked, 0.1s Time] [2024-10-13 10:52:22,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-13 10:52:22,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-10-13 10:52:22,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 59 states have (on average 1.3559322033898304) internal successors, (80), 72 states have internal predecessors, (80), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 10:52:22,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2024-10-13 10:52:22,800 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 25 [2024-10-13 10:52:22,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:52:22,800 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2024-10-13 10:52:22,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 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-10-13 10:52:22,801 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2024-10-13 10:52:22,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-13 10:52:22,801 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:52:22,801 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:52:22,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-13 10:52:23,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:52:23,006 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-10-13 10:52:23,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:52:23,006 INFO L85 PathProgramCache]: Analyzing trace with hash -394812817, now seen corresponding path program 1 times [2024-10-13 10:52:23,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:52:23,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127126976] [2024-10-13 10:52:23,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:23,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:52:23,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:23,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:52:23,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:23,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 10:52:23,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:23,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 10:52:23,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:23,625 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 10:52:23,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:52:23,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127126976] [2024-10-13 10:52:23,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127126976] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:52:23,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884857071] [2024-10-13 10:52:23,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:23,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:52:23,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:52:23,627 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-10-13 10:52:23,629 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-10-13 10:52:23,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:23,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-13 10:52:23,768 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:52:23,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-13 10:52:23,853 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:52:23,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-13 10:52:23,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 10:52:23,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 10:52:23,955 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 10:52:23,956 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 59 treesize of output 52 [2024-10-13 10:52:23,960 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 24 treesize of output 11 [2024-10-13 10:52:24,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2024-10-13 10:52:24,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-13 10:52:24,071 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2024-10-13 10:52:24,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:52:24,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-13 10:52:24,092 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:52:24,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-13 10:52:24,113 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-13 10:52:24,113 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:52:24,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884857071] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:52:24,215 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:52:24,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2024-10-13 10:52:24,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032270847] [2024-10-13 10:52:24,216 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:52:24,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-13 10:52:24,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:52:24,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-13 10:52:24,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=574, Unknown=1, NotChecked=48, Total=702 [2024-10-13 10:52:24,217 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 25 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 18 states have internal predecessors, (31), 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-10-13 10:52:24,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:52:24,653 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2024-10-13 10:52:24,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 10:52:24,653 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 18 states have internal predecessors, (31), 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 25 [2024-10-13 10:52:24,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:52:24,654 INFO L225 Difference]: With dead ends: 74 [2024-10-13 10:52:24,654 INFO L226 Difference]: Without dead ends: 74 [2024-10-13 10:52:24,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=146, Invalid=913, Unknown=1, NotChecked=62, Total=1122 [2024-10-13 10:52:24,655 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 7 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:52:24,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 384 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 407 Invalid, 0 Unknown, 54 Unchecked, 0.2s Time] [2024-10-13 10:52:24,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-13 10:52:24,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-10-13 10:52:24,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 59 states have (on average 1.305084745762712) internal successors, (77), 69 states have internal predecessors, (77), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 10:52:24,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2024-10-13 10:52:24,657 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 25 [2024-10-13 10:52:24,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:52:24,658 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2024-10-13 10:52:24,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 18 states have internal predecessors, (31), 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-10-13 10:52:24,658 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2024-10-13 10:52:24,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-13 10:52:24,658 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:52:24,658 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:52:24,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-13 10:52:24,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:52:24,863 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-10-13 10:52:24,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:52:24,863 INFO L85 PathProgramCache]: Analyzing trace with hash -393404590, now seen corresponding path program 1 times [2024-10-13 10:52:24,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:52:24,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481162765] [2024-10-13 10:52:24,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:24,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:52:24,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:24,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:52:24,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:25,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:52:25,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:52:25,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481162765] [2024-10-13 10:52:25,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481162765] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:52:25,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:52:25,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 10:52:25,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368461716] [2024-10-13 10:52:25,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:52:25,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 10:52:25,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:52:25,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 10:52:25,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-13 10:52:25,003 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:52:25,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:52:25,115 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2024-10-13 10:52:25,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 10:52:25,115 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-10-13 10:52:25,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:52:25,116 INFO L225 Difference]: With dead ends: 75 [2024-10-13 10:52:25,116 INFO L226 Difference]: Without dead ends: 75 [2024-10-13 10:52:25,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-13 10:52:25,116 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 12 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:52:25,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 152 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:52:25,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-13 10:52:25,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-10-13 10:52:25,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 60 states have (on average 1.3) internal successors, (78), 70 states have internal predecessors, (78), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 10:52:25,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2024-10-13 10:52:25,120 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 25 [2024-10-13 10:52:25,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:52:25,120 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2024-10-13 10:52:25,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-13 10:52:25,120 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2024-10-13 10:52:25,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 10:52:25,121 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:52:25,121 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] [2024-10-13 10:52:25,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-13 10:52:25,121 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-10-13 10:52:25,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:52:25,121 INFO L85 PathProgramCache]: Analyzing trace with hash -760601761, now seen corresponding path program 1 times [2024-10-13 10:52:25,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:52:25,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609532711] [2024-10-13 10:52:25,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:25,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:52:25,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:25,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:52:25,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:25,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 10:52:25,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:25,431 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:52:25,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:52:25,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609532711] [2024-10-13 10:52:25,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609532711] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:52:25,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664467446] [2024-10-13 10:52:25,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:25,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:52:25,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:52:25,434 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-10-13 10:52:25,435 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-10-13 10:52:25,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:25,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-13 10:52:25,579 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:52:25,730 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:52:25,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-13 10:52:25,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 10:52:25,830 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 10:52:25,830 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 34 treesize of output 33 [2024-10-13 10:52:25,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-13 10:52:25,913 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:52:25,914 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:52:25,997 INFO L349 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2024-10-13 10:52:25,998 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 18 [2024-10-13 10:52:26,087 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:52:26,089 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 18 treesize of output 19 [2024-10-13 10:52:26,096 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:52:26,096 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 30 treesize of output 33 [2024-10-13 10:52:26,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-13 10:52:26,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664467446] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:52:26,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:52:26,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 25 [2024-10-13 10:52:26,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321686944] [2024-10-13 10:52:26,200 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:52:26,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-13 10:52:26,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:52:26,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-13 10:52:26,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=894, Unknown=1, NotChecked=0, Total=992 [2024-10-13 10:52:26,201 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 26 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 21 states have internal predecessors, (41), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 10:52:26,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:52:26,542 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2024-10-13 10:52:26,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 10:52:26,542 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 21 states have internal predecessors, (41), 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 26 [2024-10-13 10:52:26,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:52:26,543 INFO L225 Difference]: With dead ends: 79 [2024-10-13 10:52:26,543 INFO L226 Difference]: Without dead ends: 79 [2024-10-13 10:52:26,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=151, Invalid=1254, Unknown=1, NotChecked=0, Total=1406 [2024-10-13 10:52:26,544 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 10 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:52:26,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 474 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:52:26,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-13 10:52:26,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2024-10-13 10:52:26,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 73 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 10:52:26,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2024-10-13 10:52:26,546 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 26 [2024-10-13 10:52:26,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:52:26,546 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2024-10-13 10:52:26,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 21 states have internal predecessors, (41), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 10:52:26,547 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2024-10-13 10:52:26,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 10:52:26,547 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:52:26,548 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] [2024-10-13 10:52:26,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-13 10:52:26,749 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,SelfDestructingSolverStorable25 [2024-10-13 10:52:26,749 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-10-13 10:52:26,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:52:26,750 INFO L85 PathProgramCache]: Analyzing trace with hash -760601760, now seen corresponding path program 1 times [2024-10-13 10:52:26,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:52:26,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860985861] [2024-10-13 10:52:26,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:26,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:52:26,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:27,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:52:27,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:27,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 10:52:27,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:27,172 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:52:27,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:52:27,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860985861] [2024-10-13 10:52:27,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860985861] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:52:27,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841058023] [2024-10-13 10:52:27,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:27,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:52:27,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:52:27,174 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-10-13 10:52:27,176 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-10-13 10:52:27,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:27,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-13 10:52:27,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:52:27,476 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:52:27,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-13 10:52:27,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 10:52:27,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 10:52:27,597 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 10:52:27,597 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 56 treesize of output 51 [2024-10-13 10:52:27,601 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 39 treesize of output 24 [2024-10-13 10:52:27,698 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 19 [2024-10-13 10:52:27,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-10-13 10:52:27,724 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:52:27,724 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:52:27,858 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:52:27,858 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 42 treesize of output 46 [2024-10-13 10:52:28,001 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:52:28,002 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 59 treesize of output 52 [2024-10-13 10:52:28,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:52:28,009 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 83 treesize of output 74 [2024-10-13 10:52:28,016 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:52:28,017 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 59 treesize of output 60 [2024-10-13 10:52:28,022 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 51 treesize of output 49 [2024-10-13 10:52:28,034 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:52:28,035 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 70 treesize of output 73 [2024-10-13 10:52:28,041 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 57 treesize of output 55 [2024-10-13 10:52:28,046 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 55 treesize of output 53 [2024-10-13 10:52:28,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841058023] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:52:28,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:52:28,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 27 [2024-10-13 10:52:28,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176072654] [2024-10-13 10:52:28,184 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:52:28,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-13 10:52:28,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:52:28,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-13 10:52:28,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1081, Unknown=2, NotChecked=0, Total=1190 [2024-10-13 10:52:28,185 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand has 28 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 23 states have internal predecessors, (43), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 10:52:28,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:52:28,566 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2024-10-13 10:52:28,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 10:52:28,567 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 23 states have internal predecessors, (43), 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 26 [2024-10-13 10:52:28,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:52:28,567 INFO L225 Difference]: With dead ends: 80 [2024-10-13 10:52:28,567 INFO L226 Difference]: Without dead ends: 80 [2024-10-13 10:52:28,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=158, Invalid=1400, Unknown=2, NotChecked=0, Total=1560 [2024-10-13 10:52:28,569 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 12 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:52:28,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 551 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:52:28,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-13 10:52:28,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2024-10-13 10:52:28,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 63 states have (on average 1.3015873015873016) internal successors, (82), 73 states have internal predecessors, (82), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 10:52:28,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2024-10-13 10:52:28,572 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 26 [2024-10-13 10:52:28,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:52:28,572 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2024-10-13 10:52:28,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 23 states have internal predecessors, (43), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-13 10:52:28,572 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2024-10-13 10:52:28,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-13 10:52:28,573 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:52:28,573 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] [2024-10-13 10:52:28,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-13 10:52:28,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-10-13 10:52:28,778 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-10-13 10:52:28,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:52:28,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1049743832, now seen corresponding path program 1 times [2024-10-13 10:52:28,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:52:28,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210566072] [2024-10-13 10:52:28,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:28,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:52:28,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:28,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:52:28,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:28,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:52:28,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:52:28,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210566072] [2024-10-13 10:52:28,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210566072] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:52:28,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713166597] [2024-10-13 10:52:28,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:28,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:52:28,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:52:28,941 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-10-13 10:52:28,942 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-10-13 10:52:29,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:29,077 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-13 10:52:29,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:52:29,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:52:29,231 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 15 treesize of output 15 [2024-10-13 10:52:29,238 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:52:29,238 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 15 treesize of output 15 [2024-10-13 10:52:29,269 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:52:29,269 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:52:29,382 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-10-13 10:52:29,382 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 24 treesize of output 23 [2024-10-13 10:52:29,393 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-10-13 10:52:29,394 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 12 [2024-10-13 10:52:29,483 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:52:29,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713166597] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:52:29,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:52:29,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 21 [2024-10-13 10:52:29,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535726069] [2024-10-13 10:52:29,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:52:29,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-13 10:52:29,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:52:29,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-13 10:52:29,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=376, Unknown=0, NotChecked=0, Total=420 [2024-10-13 10:52:29,485 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand has 21 states, 20 states have (on average 2.7) internal successors, (54), 19 states have internal predecessors, (54), 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-10-13 10:52:29,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:52:29,867 INFO L93 Difference]: Finished difference Result 97 states and 112 transitions. [2024-10-13 10:52:29,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-13 10:52:29,868 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.7) internal successors, (54), 19 states have internal predecessors, (54), 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 28 [2024-10-13 10:52:29,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:52:29,869 INFO L225 Difference]: With dead ends: 97 [2024-10-13 10:52:29,869 INFO L226 Difference]: Without dead ends: 97 [2024-10-13 10:52:29,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=672, Unknown=0, NotChecked=0, Total=756 [2024-10-13 10:52:29,869 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 23 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:52:29,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 305 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:52:29,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-13 10:52:29,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 92. [2024-10-13 10:52:29,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 77 states have (on average 1.3116883116883118) internal successors, (101), 87 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 10:52:29,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 107 transitions. [2024-10-13 10:52:29,872 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 107 transitions. Word has length 28 [2024-10-13 10:52:29,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:52:29,872 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 107 transitions. [2024-10-13 10:52:29,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.7) internal successors, (54), 19 states have internal predecessors, (54), 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-10-13 10:52:29,872 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 107 transitions. [2024-10-13 10:52:29,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-13 10:52:29,873 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:52:29,873 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:52:29,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-13 10:52:30,073 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,SelfDestructingSolverStorable27 [2024-10-13 10:52:30,074 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-10-13 10:52:30,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:52:30,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1158976705, now seen corresponding path program 1 times [2024-10-13 10:52:30,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:52:30,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873153105] [2024-10-13 10:52:30,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:30,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:52:30,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:30,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:52:30,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:30,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 10:52:30,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:30,409 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:52:30,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:52:30,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873153105] [2024-10-13 10:52:30,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873153105] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:52:30,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371018390] [2024-10-13 10:52:30,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:30,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:52:30,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:52:30,412 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-10-13 10:52:30,413 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-10-13 10:52:30,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:30,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-10-13 10:52:30,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:52:30,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-13 10:52:30,658 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:52:30,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-13 10:52:30,666 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-10-13 10:52:30,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 10:52:30,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:52:30,710 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 13 [2024-10-13 10:52:30,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-10-13 10:52:30,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 18 treesize of output 13 [2024-10-13 10:52:30,862 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:52:30,862 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:52:30,913 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1505 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.offset| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset|) v_ArrVal_1505) |c_ULTIMATE.start_create_~sll~0#1.base|) (+ |c_ULTIMATE.start_create_~sll~0#1.offset| 8)) 0)) is different from false [2024-10-13 10:52:31,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371018390] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:52:31,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:52:31,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2024-10-13 10:52:31,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481558736] [2024-10-13 10:52:31,010 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:52:31,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-13 10:52:31,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:52:31,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-13 10:52:31,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=708, Unknown=28, NotChecked=54, Total=870 [2024-10-13 10:52:31,011 INFO L87 Difference]: Start difference. First operand 92 states and 107 transitions. Second operand has 26 states, 24 states have (on average 2.0) internal successors, (48), 22 states have internal predecessors, (48), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 10:52:31,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:52:31,388 INFO L93 Difference]: Finished difference Result 111 states and 128 transitions. [2024-10-13 10:52:31,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-13 10:52:31,389 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.0) internal successors, (48), 22 states have internal predecessors, (48), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2024-10-13 10:52:31,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:52:31,390 INFO L225 Difference]: With dead ends: 111 [2024-10-13 10:52:31,390 INFO L226 Difference]: Without dead ends: 111 [2024-10-13 10:52:31,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=152, Invalid=1305, Unknown=29, NotChecked=74, Total=1560 [2024-10-13 10:52:31,391 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 26 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:52:31,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 384 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:52:31,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-13 10:52:31,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 99. [2024-10-13 10:52:31,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 84 states have (on average 1.3214285714285714) internal successors, (111), 94 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-10-13 10:52:31,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 117 transitions. [2024-10-13 10:52:31,397 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 117 transitions. Word has length 29 [2024-10-13 10:52:31,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:52:31,398 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 117 transitions. [2024-10-13 10:52:31,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.0) internal successors, (48), 22 states have internal predecessors, (48), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 10:52:31,398 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 117 transitions. [2024-10-13 10:52:31,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-13 10:52:31,398 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:52:31,398 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:52:31,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-13 10:52:31,599 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,SelfDestructingSolverStorable28 [2024-10-13 10:52:31,599 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2024-10-13 10:52:31,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:52:31,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1162478973, now seen corresponding path program 2 times [2024-10-13 10:52:31,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:52:31,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386779418] [2024-10-13 10:52:31,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:52:31,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:52:31,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:32,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:52:32,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:32,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-13 10:52:32,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:52:32,170 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:52:32,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:52:32,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386779418] [2024-10-13 10:52:32,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386779418] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:52:32,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509244963] [2024-10-13 10:52:32,171 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:52:32,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:52:32,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:52:32,173 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-10-13 10:52:32,174 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-10-13 10:52:32,348 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 10:52:32,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:52:32,349 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-10-13 10:52:32,352 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:52:32,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 10:52:32,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 10:52:32,515 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:52:32,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-10-13 10:52:32,565 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 15 [2024-10-13 10:52:32,569 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 22 [2024-10-13 10:52:32,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:52:32,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:52:32,677 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-13 10:52:32,677 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 60 [2024-10-13 10:52:32,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:52:32,684 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 40 treesize of output 38 [2024-10-13 10:52:32,948 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:52:32,948 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:52:42,399 INFO L349 Elim1Store]: treesize reduction 231, result has 54.1 percent of original size [2024-10-13 10:52:42,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 9 new quantified variables, introduced 17 case distinctions, treesize of input 2756 treesize of output 1856 [2024-10-13 10:52:42,825 INFO L349 Elim1Store]: treesize reduction 192, result has 40.9 percent of original size [2024-10-13 10:52:42,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 23 case distinctions, treesize of input 2598 treesize of output 2164 [2024-10-13 10:52:43,059 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:52:43,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 2000 treesize of output 2074 [2024-10-13 10:52:43,627 INFO L349 Elim1Store]: treesize reduction 361, result has 52.2 percent of original size [2024-10-13 10:52:43,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 2394 treesize of output 2225 [2024-10-13 10:52:44,156 INFO L349 Elim1Store]: treesize reduction 312, result has 41.5 percent of original size [2024-10-13 10:52:44,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 1935 treesize of output 2061 [2024-10-13 10:52:44,427 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:52:44,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 1921 treesize of output 2061 [2024-10-13 10:52:54,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-13 10:52:54,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-13 10:52:54,547 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:52:54,548 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 31 treesize of output 35 [2024-10-13 10:52:54,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-13 10:52:54,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4