./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-broom/sll-shared-after.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-broom/sll-shared-after.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 5faf2b9991f99879bc04c4df6a221302164ff0866019f72f7b8508bf5bf7cdcb --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:55:47,940 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:55:47,997 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-09 07:55:48,002 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:55:48,003 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:55:48,017 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:55:48,018 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:55:48,018 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:55:48,019 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:55:48,019 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:55:48,019 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:55:48,020 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:55:48,020 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:55:48,020 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:55:48,021 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:55:48,021 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:55:48,022 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:55:48,023 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:55:48,024 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:55:48,024 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:55:48,024 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:55:48,025 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:55:48,025 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:55:48,025 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:55:48,025 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:55:48,025 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:55:48,026 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:55:48,026 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:55:48,026 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:55:48,026 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:55:48,026 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:55:48,027 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:55:48,027 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:55:48,030 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:55:48,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:55:48,031 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:55:48,031 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:55:48,031 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:55:48,031 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:55:48,040 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 -> 5faf2b9991f99879bc04c4df6a221302164ff0866019f72f7b8508bf5bf7cdcb [2024-11-09 07:55:48,277 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:55:48,299 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:55:48,302 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:55:48,303 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:55:48,303 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:55:48,304 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-broom/sll-shared-after.i [2024-11-09 07:55:49,587 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:55:49,819 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:55:49,819 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-shared-after.i [2024-11-09 07:55:49,838 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c67fa2763/b74c7c6cf07b40cbbf87bb7e363543c0/FLAG2f6c60de2 [2024-11-09 07:55:49,854 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c67fa2763/b74c7c6cf07b40cbbf87bb7e363543c0 [2024-11-09 07:55:49,860 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:55:49,865 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:55:49,866 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:55:49,866 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:55:49,870 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:55:49,871 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:55:49" (1/1) ... [2024-11-09 07:55:49,872 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@466266c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:49, skipping insertion in model container [2024-11-09 07:55:49,872 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:55:49" (1/1) ... [2024-11-09 07:55:49,918 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:55:50,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:55:50,197 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:55:50,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:55:50,268 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:55:50,269 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:50 WrapperNode [2024-11-09 07:55:50,269 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:55:50,270 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:55:50,270 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:55:50,270 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:55:50,276 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:50" (1/1) ... [2024-11-09 07:55:50,297 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:50" (1/1) ... [2024-11-09 07:55:50,315 INFO L138 Inliner]: procedures = 121, calls = 18, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 66 [2024-11-09 07:55:50,316 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:55:50,317 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:55:50,317 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:55:50,317 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:55:50,329 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:50" (1/1) ... [2024-11-09 07:55:50,330 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:50" (1/1) ... [2024-11-09 07:55:50,332 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:50" (1/1) ... [2024-11-09 07:55:50,351 INFO L175 MemorySlicer]: Split 7 memory accesses to 1 slices as follows [7]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 4 writes are split as follows [4]. [2024-11-09 07:55:50,351 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:50" (1/1) ... [2024-11-09 07:55:50,351 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:50" (1/1) ... [2024-11-09 07:55:50,358 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:50" (1/1) ... [2024-11-09 07:55:50,361 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:50" (1/1) ... [2024-11-09 07:55:50,362 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:50" (1/1) ... [2024-11-09 07:55:50,362 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:50" (1/1) ... [2024-11-09 07:55:50,364 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:55:50,365 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:55:50,365 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:55:50,365 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:55:50,366 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:50" (1/1) ... [2024-11-09 07:55:50,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:55:50,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:55:50,398 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 07:55:50,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 07:55:50,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 07:55:50,452 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2024-11-09 07:55:50,452 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2024-11-09 07:55:50,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:55:50,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 07:55:50,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 07:55:50,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:55:50,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:55:50,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:55:50,602 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:55:50,608 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:55:50,850 INFO L? ?]: Removed 59 outVars from TransFormulas that were not future-live. [2024-11-09 07:55:50,852 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:55:50,863 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:55:50,865 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-09 07:55:50,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:55:50 BoogieIcfgContainer [2024-11-09 07:55:50,866 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:55:50,868 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:55:50,868 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:55:50,871 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:55:50,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:55:49" (1/3) ... [2024-11-09 07:55:50,872 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4722d2de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:55:50, skipping insertion in model container [2024-11-09 07:55:50,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:55:50" (2/3) ... [2024-11-09 07:55:50,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4722d2de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:55:50, skipping insertion in model container [2024-11-09 07:55:50,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:55:50" (3/3) ... [2024-11-09 07:55:50,874 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-shared-after.i [2024-11-09 07:55:50,886 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:55:50,887 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2024-11-09 07:55:50,922 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:55:50,927 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;@43952164, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:55:50,928 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2024-11-09 07:55:50,931 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 55 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:55:50,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 07:55:50,936 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:50,936 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 07:55:50,937 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 18 more)] === [2024-11-09 07:55:50,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:50,941 INFO L85 PathProgramCache]: Analyzing trace with hash 34497980, now seen corresponding path program 1 times [2024-11-09 07:55:50,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:50,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526703844] [2024-11-09 07:55:50,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:50,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:51,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:51,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:51,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:51,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526703844] [2024-11-09 07:55:51,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526703844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:51,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:51,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:55:51,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661290586] [2024-11-09 07:55:51,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:51,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:55:51,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:51,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:55:51,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:55:51,188 INFO L87 Difference]: Start difference. First operand has 59 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 55 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:55:51,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:51,257 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2024-11-09 07:55:51,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:55:51,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-09 07:55:51,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:51,269 INFO L225 Difference]: With dead ends: 58 [2024-11-09 07:55:51,269 INFO L226 Difference]: Without dead ends: 56 [2024-11-09 07:55:51,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:55:51,273 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 1 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:51,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 94 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:55:51,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-09 07:55:51,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-09 07:55:51,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 52 states have internal predecessors, (55), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:55:51,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2024-11-09 07:55:51,306 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 5 [2024-11-09 07:55:51,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:51,307 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2024-11-09 07:55:51,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:55:51,307 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2024-11-09 07:55:51,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 07:55:51,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:51,308 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 07:55:51,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:55:51,309 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 18 more)] === [2024-11-09 07:55:51,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:51,310 INFO L85 PathProgramCache]: Analyzing trace with hash 34497981, now seen corresponding path program 1 times [2024-11-09 07:55:51,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:51,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119918912] [2024-11-09 07:55:51,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:51,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:51,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:51,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:51,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:51,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119918912] [2024-11-09 07:55:51,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119918912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:51,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:51,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:55:51,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300412641] [2024-11-09 07:55:51,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:51,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:55:51,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:51,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:55:51,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:55:51,405 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:55:51,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:51,447 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2024-11-09 07:55:51,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:55:51,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-09 07:55:51,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:51,449 INFO L225 Difference]: With dead ends: 55 [2024-11-09 07:55:51,450 INFO L226 Difference]: Without dead ends: 55 [2024-11-09 07:55:51,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:55:51,451 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 1 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:51,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 98 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:55:51,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-09 07:55:51,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-09 07:55:51,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 51 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-11-09 07:55:51,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2024-11-09 07:55:51,457 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 5 [2024-11-09 07:55:51,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:51,457 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2024-11-09 07:55:51,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:55:51,458 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2024-11-09 07:55:51,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 07:55:51,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:51,458 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:51,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:55:51,458 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 07:55:51,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:51,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1343831912, now seen corresponding path program 1 times [2024-11-09 07:55:51,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:51,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498411568] [2024-11-09 07:55:51,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:51,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:51,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:51,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:51,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:51,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:51,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:51,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498411568] [2024-11-09 07:55:51,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498411568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:51,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:51,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:55:51,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85837324] [2024-11-09 07:55:51,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:51,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:55:51,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:51,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:55:51,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:55:51,572 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:55:51,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:51,660 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2024-11-09 07:55:51,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:55:51,661 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 14 [2024-11-09 07:55:51,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:51,662 INFO L225 Difference]: With dead ends: 70 [2024-11-09 07:55:51,662 INFO L226 Difference]: Without dead ends: 70 [2024-11-09 07:55:51,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:55:51,663 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 27 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:51,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 93 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:55:51,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-09 07:55:51,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 59. [2024-11-09 07:55:51,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.605263157894737) internal successors, (61), 55 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:55:51,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2024-11-09 07:55:51,669 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 14 [2024-11-09 07:55:51,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:51,671 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2024-11-09 07:55:51,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:55:51,671 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2024-11-09 07:55:51,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 07:55:51,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:51,672 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:51,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:55:51,672 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 07:55:51,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:51,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1343831911, now seen corresponding path program 1 times [2024-11-09 07:55:51,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:51,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424777990] [2024-11-09 07:55:51,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:51,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:51,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:51,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:51,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:51,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:51,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:51,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424777990] [2024-11-09 07:55:51,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424777990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:51,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:51,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:55:51,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585723353] [2024-11-09 07:55:51,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:51,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:55:51,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:51,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:55:51,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:55:51,791 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:55:51,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:51,859 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2024-11-09 07:55:51,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:55:51,859 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 14 [2024-11-09 07:55:51,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:51,861 INFO L225 Difference]: With dead ends: 57 [2024-11-09 07:55:51,862 INFO L226 Difference]: Without dead ends: 57 [2024-11-09 07:55:51,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:55:51,864 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 25 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:51,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 87 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:55:51,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-09 07:55:51,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-09 07:55:51,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 53 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-11-09 07:55:51,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2024-11-09 07:55:51,869 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 14 [2024-11-09 07:55:51,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:51,869 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2024-11-09 07:55:51,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:55:51,869 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2024-11-09 07:55:51,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 07:55:51,870 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:51,870 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:51,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:55:51,871 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 07:55:51,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:51,871 INFO L85 PathProgramCache]: Analyzing trace with hash -706315150, now seen corresponding path program 1 times [2024-11-09 07:55:51,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:51,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120061417] [2024-11-09 07:55:51,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:51,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:51,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:52,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:52,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:52,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:52,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:52,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120061417] [2024-11-09 07:55:52,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120061417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:52,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:52,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 07:55:52,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180701455] [2024-11-09 07:55:52,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:52,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 07:55:52,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:52,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 07:55:52,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:55:52,248 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:55:52,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:52,453 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2024-11-09 07:55:52,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 07:55:52,454 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-09 07:55:52,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:52,459 INFO L225 Difference]: With dead ends: 73 [2024-11-09 07:55:52,460 INFO L226 Difference]: Without dead ends: 73 [2024-11-09 07:55:52,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:55:52,461 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 28 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:52,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 209 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:55:52,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-09 07:55:52,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 64. [2024-11-09 07:55:52,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 46 states have (on average 1.4782608695652173) internal successors, (68), 60 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:55:52,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2024-11-09 07:55:52,470 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 17 [2024-11-09 07:55:52,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:52,470 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2024-11-09 07:55:52,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:55:52,473 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2024-11-09 07:55:52,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 07:55:52,473 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:52,474 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:52,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:55:52,474 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 07:55:52,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:52,474 INFO L85 PathProgramCache]: Analyzing trace with hash -706315149, now seen corresponding path program 1 times [2024-11-09 07:55:52,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:52,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607516585] [2024-11-09 07:55:52,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:52,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:52,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:52,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:52,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:52,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:52,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:52,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607516585] [2024-11-09 07:55:52,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607516585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:52,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:52,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 07:55:52,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239542718] [2024-11-09 07:55:52,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:52,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 07:55:52,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:52,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 07:55:52,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:55:52,897 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:55:53,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:53,050 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2024-11-09 07:55:53,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:55:53,051 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-09 07:55:53,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:53,051 INFO L225 Difference]: With dead ends: 74 [2024-11-09 07:55:53,052 INFO L226 Difference]: Without dead ends: 74 [2024-11-09 07:55:53,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:55:53,053 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 15 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:53,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 221 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:55:53,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-09 07:55:53,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 65. [2024-11-09 07:55:53,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 47 states have (on average 1.446808510638298) internal successors, (68), 61 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:55:53,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2024-11-09 07:55:53,057 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 17 [2024-11-09 07:55:53,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:53,057 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2024-11-09 07:55:53,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:55:53,057 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2024-11-09 07:55:53,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 07:55:53,058 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:53,058 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:53,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:55:53,058 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 07:55:53,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:53,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1219914795, now seen corresponding path program 1 times [2024-11-09 07:55:53,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:53,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445532720] [2024-11-09 07:55:53,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:53,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:53,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:53,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:53,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:53,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 07:55:53,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:53,231 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:55:53,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:53,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445532720] [2024-11-09 07:55:53,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445532720] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:55:53,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504126531] [2024-11-09 07:55:53,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:53,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:55:53,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:55:53,237 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:55:53,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 07:55:53,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:53,310 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 07:55:53,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:55:53,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:55:53,401 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base 1))) is different from true [2024-11-09 07:55:53,433 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 07:55:53,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-09 07:55:53,445 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-09 07:55:53,445 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:55:53,603 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:53,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504126531] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:55:53,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:55:53,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 11 [2024-11-09 07:55:53,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811686472] [2024-11-09 07:55:53,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:55:53,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 07:55:53,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:53,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 07:55:53,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2024-11-09 07:55:53,609 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 07:55:53,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:53,790 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2024-11-09 07:55:53,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:55:53,790 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 18 [2024-11-09 07:55:53,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:53,792 INFO L225 Difference]: With dead ends: 66 [2024-11-09 07:55:53,792 INFO L226 Difference]: Without dead ends: 66 [2024-11-09 07:55:53,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=119, Unknown=1, NotChecked=22, Total=182 [2024-11-09 07:55:53,793 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 4 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:53,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 223 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 187 Invalid, 0 Unknown, 58 Unchecked, 0.1s Time] [2024-11-09 07:55:53,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-09 07:55:53,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-09 07:55:53,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 48 states have (on average 1.4375) internal successors, (69), 61 states have internal predecessors, (69), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:55:53,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2024-11-09 07:55:53,800 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 18 [2024-11-09 07:55:53,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:53,800 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2024-11-09 07:55:53,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 07:55:53,800 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2024-11-09 07:55:53,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 07:55:53,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:53,801 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:53,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 07:55:54,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:55:54,005 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 07:55:54,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:54,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1219914796, now seen corresponding path program 1 times [2024-11-09 07:55:54,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:54,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963550609] [2024-11-09 07:55:54,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:54,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:54,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:54,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:54,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:54,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 07:55:54,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:54,331 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:55:54,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:54,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963550609] [2024-11-09 07:55:54,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963550609] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:55:54,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873943344] [2024-11-09 07:55:54,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:54,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:55:54,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:55:54,334 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:55:54,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 07:55:54,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:54,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 07:55:54,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:55:54,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 07:55:54,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:55:54,568 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2024-11-09 07:55:54,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:55:54,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 07:55:54,616 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:55:54,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:55:54,618 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-09 07:55:54,618 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:55:54,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873943344] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:55:54,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:55:54,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2024-11-09 07:55:54,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245796067] [2024-11-09 07:55:54,784 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:55:54,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 07:55:54,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:54,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 07:55:54,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=201, Unknown=1, NotChecked=28, Total=272 [2024-11-09 07:55:54,786 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 07:55:55,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:55,049 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2024-11-09 07:55:55,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:55:55,050 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 18 [2024-11-09 07:55:55,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:55,050 INFO L225 Difference]: With dead ends: 68 [2024-11-09 07:55:55,051 INFO L226 Difference]: Without dead ends: 68 [2024-11-09 07:55:55,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=255, Unknown=1, NotChecked=32, Total=342 [2024-11-09 07:55:55,051 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 3 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:55,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 261 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 207 Invalid, 0 Unknown, 59 Unchecked, 0.2s Time] [2024-11-09 07:55:55,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-09 07:55:55,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-09 07:55:55,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 50 states have (on average 1.4) 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-11-09 07:55:55,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2024-11-09 07:55:55,055 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 18 [2024-11-09 07:55:55,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:55,055 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2024-11-09 07:55:55,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 07:55:55,055 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2024-11-09 07:55:55,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 07:55:55,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:55,056 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:55:55,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 07:55:55,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-09 07:55:55,257 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 07:55:55,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:55,258 INFO L85 PathProgramCache]: Analyzing trace with hash -164075137, now seen corresponding path program 1 times [2024-11-09 07:55:55,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:55,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721112230] [2024-11-09 07:55:55,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:55,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:55,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:55,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:55,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:55,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:55,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:55,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721112230] [2024-11-09 07:55:55,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721112230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:55:55,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:55:55,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 07:55:55,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632122753] [2024-11-09 07:55:55,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:55:55,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:55:55,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:55,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:55:55,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:55:55,351 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:55:55,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:55,438 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2024-11-09 07:55:55,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:55:55,438 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-11-09 07:55:55,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:55,439 INFO L225 Difference]: With dead ends: 71 [2024-11-09 07:55:55,439 INFO L226 Difference]: Without dead ends: 71 [2024-11-09 07:55:55,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:55:55,439 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 22 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:55,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 329 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:55:55,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-09 07:55:55,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2024-11-09 07:55:55,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 64 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-11-09 07:55:55,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2024-11-09 07:55:55,450 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 19 [2024-11-09 07:55:55,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:55,450 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2024-11-09 07:55:55,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:55:55,450 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2024-11-09 07:55:55,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 07:55:55,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:55,451 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] [2024-11-09 07:55:55,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 07:55:55,451 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 07:55:55,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:55,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1285116854, now seen corresponding path program 1 times [2024-11-09 07:55:55,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:55,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987763972] [2024-11-09 07:55:55,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:55,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:55,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:55,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:55,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:55,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:55,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:55,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987763972] [2024-11-09 07:55:55,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987763972] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:55:55,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030994559] [2024-11-09 07:55:55,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:55,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:55:55,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:55:55,876 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:55:55,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 07:55:55,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:55,949 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-09 07:55:55,951 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:55:55,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:55:55,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:55:56,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 07:55:56,131 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 07:55:56,132 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 16 treesize of output 15 [2024-11-09 07:55:56,143 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 07:55:56,143 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 16 treesize of output 15 [2024-11-09 07:55:56,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2024-11-09 07:55:56,248 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 42 treesize of output 30 [2024-11-09 07:55:56,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:56,293 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:55:56,612 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 81 treesize of output 77 [2024-11-09 07:55:57,617 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:55:57,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-11-09 07:55:57,622 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:55:57,633 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-09 07:55:57,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 11 [2024-11-09 07:55:57,646 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 07:55:57,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2024-11-09 07:55:57,704 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:57,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030994559] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:55:57,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:55:57,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 33 [2024-11-09 07:55:57,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979874890] [2024-11-09 07:55:57,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:55:57,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-09 07:55:57,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:57,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-09 07:55:57,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=957, Unknown=1, NotChecked=0, Total=1056 [2024-11-09 07:55:57,707 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand has 33 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 29 states have internal predecessors, (47), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:55:58,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:58,347 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2024-11-09 07:55:58,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:55:58,347 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 29 states have internal predecessors, (47), 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 21 [2024-11-09 07:55:58,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:58,348 INFO L225 Difference]: With dead ends: 72 [2024-11-09 07:55:58,348 INFO L226 Difference]: Without dead ends: 72 [2024-11-09 07:55:58,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=140, Invalid=1191, Unknown=1, NotChecked=0, Total=1332 [2024-11-09 07:55:58,349 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 17 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:58,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 667 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 07:55:58,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-09 07:55:58,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2024-11-09 07:55:58,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 66 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-11-09 07:55:58,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2024-11-09 07:55:58,359 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 21 [2024-11-09 07:55:58,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:58,360 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2024-11-09 07:55:58,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 29 states have internal predecessors, (47), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:55:58,378 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2024-11-09 07:55:58,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 07:55:58,379 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:58,379 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-11-09 07:55:58,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 07:55:58,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:55:58,581 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 07:55:58,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:58,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1953333309, now seen corresponding path program 1 times [2024-11-09 07:55:58,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:58,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606523807] [2024-11-09 07:55:58,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:58,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:58,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:58,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:58,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:58,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:58,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:58,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606523807] [2024-11-09 07:55:58,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606523807] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:55:58,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300710695] [2024-11-09 07:55:58,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:58,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:55:58,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:55:58,682 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:55:58,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 07:55:58,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:58,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 07:55:58,763 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:55:58,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:58,783 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:55:58,807 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-09 07:55:58,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2024-11-09 07:55:58,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:58,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300710695] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:55:58,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:55:58,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 6 [2024-11-09 07:55:58,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317131555] [2024-11-09 07:55:58,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:55:58,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:55:58,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:58,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:55:58,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:55:58,817 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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-11-09 07:55:58,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:58,937 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2024-11-09 07:55:58,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:55:58,938 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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 23 [2024-11-09 07:55:58,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:58,938 INFO L225 Difference]: With dead ends: 75 [2024-11-09 07:55:58,938 INFO L226 Difference]: Without dead ends: 75 [2024-11-09 07:55:58,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 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-11-09 07:55:58,939 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 11 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:58,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 138 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:55:58,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-09 07:55:58,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2024-11-09 07:55:58,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 66 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-11-09 07:55:58,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2024-11-09 07:55:58,945 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 23 [2024-11-09 07:55:58,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:58,946 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2024-11-09 07:55:58,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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-11-09 07:55:58,946 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2024-11-09 07:55:58,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 07:55:58,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:58,947 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-11-09 07:55:58,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 07:55:59,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:55:59,148 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 07:55:59,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:55:59,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1953333308, now seen corresponding path program 1 times [2024-11-09 07:55:59,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:55:59,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362572631] [2024-11-09 07:55:59,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:59,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:55:59,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:59,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:55:59,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:59,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:59,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:55:59,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362572631] [2024-11-09 07:55:59,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362572631] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:55:59,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109913835] [2024-11-09 07:55:59,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:55:59,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:55:59,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:55:59,324 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:55:59,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 07:55:59,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:55:59,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-09 07:55:59,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:55:59,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:59,460 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:55:59,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:55:59,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2024-11-09 07:55:59,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:55:59,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109913835] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:55:59,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:55:59,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2024-11-09 07:55:59,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310257173] [2024-11-09 07:55:59,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:55:59,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 07:55:59,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:55:59,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 07:55:59,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2024-11-09 07:55:59,678 INFO L87 Difference]: Start difference. First operand 71 states and 79 transitions. Second operand has 24 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 21 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:55:59,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:55:59,867 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2024-11-09 07:55:59,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:55:59,868 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 21 states have internal predecessors, (45), 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 23 [2024-11-09 07:55:59,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:55:59,868 INFO L225 Difference]: With dead ends: 78 [2024-11-09 07:55:59,868 INFO L226 Difference]: Without dead ends: 78 [2024-11-09 07:55:59,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2024-11-09 07:55:59,869 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 43 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:55:59,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 439 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:55:59,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-09 07:55:59,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2024-11-09 07:55:59,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 68 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-11-09 07:55:59,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2024-11-09 07:55:59,872 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 23 [2024-11-09 07:55:59,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:55:59,872 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2024-11-09 07:55:59,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 21 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:55:59,873 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2024-11-09 07:55:59,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 07:55:59,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:55:59,873 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-11-09 07:55:59,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 07:56:00,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-09 07:56:00,074 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 07:56:00,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:56:00,075 INFO L85 PathProgramCache]: Analyzing trace with hash -252646958, now seen corresponding path program 1 times [2024-11-09 07:56:00,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:56:00,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227080797] [2024-11-09 07:56:00,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:00,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:56:00,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:00,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:56:00,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:00,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:56:00,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:56:00,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227080797] [2024-11-09 07:56:00,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227080797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:56:00,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:56:00,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 07:56:00,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746048485] [2024-11-09 07:56:00,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:56:00,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:56:00,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:56:00,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:56:00,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:56:00,202 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 8 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-11-09 07:56:00,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:56:00,283 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2024-11-09 07:56:00,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:56:00,284 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 8 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-11-09 07:56:00,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:56:00,284 INFO L225 Difference]: With dead ends: 71 [2024-11-09 07:56:00,284 INFO L226 Difference]: Without dead ends: 71 [2024-11-09 07:56:00,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:56:00,286 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 16 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:56:00,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 301 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:56:00,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-09 07:56:00,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2024-11-09 07:56:00,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 64 states have internal predecessors, (68), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:56:00,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2024-11-09 07:56:00,290 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 25 [2024-11-09 07:56:00,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:56:00,291 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2024-11-09 07:56:00,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 8 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-11-09 07:56:00,292 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2024-11-09 07:56:00,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 07:56:00,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:56:00,293 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:56:00,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 07:56:00,293 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 07:56:00,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:56:00,293 INFO L85 PathProgramCache]: Analyzing trace with hash 759326855, now seen corresponding path program 1 times [2024-11-09 07:56:00,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:56:00,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637333180] [2024-11-09 07:56:00,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:00,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:56:00,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:00,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:56:00,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:00,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:56:00,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:56:00,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637333180] [2024-11-09 07:56:00,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637333180] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:56:00,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:56:00,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 07:56:00,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557784350] [2024-11-09 07:56:00,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:56:00,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:56:00,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:56:00,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:56:00,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:56:00,424 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:56:00,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:56:00,510 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2024-11-09 07:56:00,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:56:00,511 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-11-09 07:56:00,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:56:00,511 INFO L225 Difference]: With dead ends: 70 [2024-11-09 07:56:00,512 INFO L226 Difference]: Without dead ends: 70 [2024-11-09 07:56:00,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:56:00,512 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 12 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:56:00,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 261 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:56:00,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-09 07:56:00,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-09 07:56:00,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 65 states have internal predecessors, (69), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:56:00,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2024-11-09 07:56:00,519 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 26 [2024-11-09 07:56:00,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:56:00,519 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2024-11-09 07:56:00,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:56:00,519 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2024-11-09 07:56:00,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 07:56:00,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:56:00,520 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:56:00,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 07:56:00,520 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 07:56:00,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:56:00,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1397842116, now seen corresponding path program 1 times [2024-11-09 07:56:00,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:56:00,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194060581] [2024-11-09 07:56:00,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:00,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:56:00,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:00,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:56:00,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:00,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 07:56:00,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:00,629 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 07:56:00,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:56:00,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194060581] [2024-11-09 07:56:00,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194060581] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:00,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305253520] [2024-11-09 07:56:00,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:00,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:56:00,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:56:00,635 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:56:00,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 07:56:00,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:00,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 07:56:00,713 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:56:00,735 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 07:56:00,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-09 07:56:00,739 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 07:56:00,739 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:56:00,822 INFO L349 Elim1Store]: treesize reduction 10, result has 60.0 percent of original size [2024-11-09 07:56:00,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2024-11-09 07:56:00,834 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 07:56:00,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305253520] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:56:00,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:56:00,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 11 [2024-11-09 07:56:00,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311930715] [2024-11-09 07:56:00,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:56:00,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 07:56:00,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:56:00,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 07:56:00,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:56:00,836 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:56:00,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:56:00,970 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2024-11-09 07:56:00,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:56:00,971 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2024-11-09 07:56:00,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:56:00,971 INFO L225 Difference]: With dead ends: 88 [2024-11-09 07:56:00,971 INFO L226 Difference]: Without dead ends: 88 [2024-11-09 07:56:00,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:56:00,972 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 15 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:56:00,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 326 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:56:00,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-09 07:56:00,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 79. [2024-11-09 07:56:00,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 74 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-11-09 07:56:00,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2024-11-09 07:56:00,978 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 29 [2024-11-09 07:56:00,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:56:00,978 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2024-11-09 07:56:00,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:56:00,979 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2024-11-09 07:56:00,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 07:56:00,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:56:00,979 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:56:00,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 07:56:01,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-09 07:56:01,184 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 07:56:01,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:56:01,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1397842115, now seen corresponding path program 1 times [2024-11-09 07:56:01,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:56:01,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198578182] [2024-11-09 07:56:01,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:01,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:56:01,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:01,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:56:01,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:01,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 07:56:01,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:01,384 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:56:01,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:56:01,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198578182] [2024-11-09 07:56:01,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198578182] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:01,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772971592] [2024-11-09 07:56:01,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:01,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:56:01,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:56:01,388 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:56:01,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 07:56:01,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:01,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-09 07:56:01,468 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:56:01,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:56:01,650 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-11-09 07:56:01,656 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:56:01,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:56:01,711 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:56:01,712 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:56:01,895 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:56:01,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 53 [2024-11-09 07:56:01,907 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:56:01,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 64 [2024-11-09 07:56:02,051 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:56:02,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772971592] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:56:02,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:56:02,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 24 [2024-11-09 07:56:02,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572013187] [2024-11-09 07:56:02,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:56:02,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-09 07:56:02,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:56:02,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-09 07:56:02,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2024-11-09 07:56:02,054 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand has 25 states, 24 states have (on average 2.5) internal successors, (60), 22 states have internal predecessors, (60), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-09 07:56:02,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:56:02,347 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2024-11-09 07:56:02,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 07:56:02,348 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.5) internal successors, (60), 22 states have internal predecessors, (60), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 29 [2024-11-09 07:56:02,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:56:02,348 INFO L225 Difference]: With dead ends: 89 [2024-11-09 07:56:02,349 INFO L226 Difference]: Without dead ends: 89 [2024-11-09 07:56:02,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=767, Unknown=0, NotChecked=0, Total=870 [2024-11-09 07:56:02,349 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 29 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:56:02,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 510 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:56:02,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-09 07:56:02,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 80. [2024-11-09 07:56:02,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 63 states have (on average 1.2698412698412698) internal successors, (80), 75 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-11-09 07:56:02,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2024-11-09 07:56:02,352 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 29 [2024-11-09 07:56:02,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:56:02,352 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2024-11-09 07:56:02,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.5) internal successors, (60), 22 states have internal predecessors, (60), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-09 07:56:02,353 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2024-11-09 07:56:02,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 07:56:02,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:56:02,353 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:56:02,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-09 07:56:02,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:56:02,558 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 07:56:02,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:56:02,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1257415329, now seen corresponding path program 1 times [2024-11-09 07:56:02,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:56:02,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363581352] [2024-11-09 07:56:02,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:02,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:56:02,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:02,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:56:02,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:02,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 07:56:02,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:02,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 07:56:02,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:02,751 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:56:02,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:56:02,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363581352] [2024-11-09 07:56:02,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363581352] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:02,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246972909] [2024-11-09 07:56:02,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:02,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:56:02,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:56:02,753 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:56:02,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 07:56:02,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:02,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 07:56:02,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:56:02,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:56:02,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 07:56:02,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-09 07:56:02,871 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base 1))) is different from true [2024-11-09 07:56:02,882 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 07:56:02,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-09 07:56:02,889 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-11-09 07:56:02,889 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:56:02,995 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:56:02,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246972909] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:56:02,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:56:02,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 13 [2024-11-09 07:56:02,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865154773] [2024-11-09 07:56:02,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:56:02,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 07:56:02,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:56:02,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 07:56:02,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=126, Unknown=1, NotChecked=22, Total=182 [2024-11-09 07:56:02,997 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 2 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 07:56:03,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:56:03,138 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2024-11-09 07:56:03,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:56:03,139 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 2 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 30 [2024-11-09 07:56:03,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:56:03,139 INFO L225 Difference]: With dead ends: 79 [2024-11-09 07:56:03,139 INFO L226 Difference]: Without dead ends: 79 [2024-11-09 07:56:03,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=223, Unknown=1, NotChecked=30, Total=306 [2024-11-09 07:56:03,140 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 4 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:56:03,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 290 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 216 Invalid, 0 Unknown, 55 Unchecked, 0.1s Time] [2024-11-09 07:56:03,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-09 07:56:03,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-09 07:56:03,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 63 states have (on average 1.253968253968254) internal successors, (79), 74 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-11-09 07:56:03,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2024-11-09 07:56:03,142 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 30 [2024-11-09 07:56:03,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:56:03,142 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2024-11-09 07:56:03,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 2 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 07:56:03,142 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2024-11-09 07:56:03,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 07:56:03,143 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:56:03,143 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:56:03,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 07:56:03,343 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,SelfDestructingSolverStorable16 [2024-11-09 07:56:03,343 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 07:56:03,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:56:03,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1257415330, now seen corresponding path program 1 times [2024-11-09 07:56:03,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:56:03,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194561066] [2024-11-09 07:56:03,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:03,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:56:03,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:03,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:56:03,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:03,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 07:56:03,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:03,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 07:56:03,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:03,593 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 07:56:03,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:56:03,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194561066] [2024-11-09 07:56:03,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194561066] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:03,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839031679] [2024-11-09 07:56:03,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:03,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:56:03,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:56:03,595 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:56:03,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 07:56:03,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:03,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-09 07:56:03,682 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:56:03,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:56:03,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 07:56:03,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 07:56:03,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 07:56:03,779 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 32 treesize of output 14 [2024-11-09 07:56:03,850 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2024-11-09 07:56:03,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:56:03,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 07:56:03,872 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:56:03,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:56:03,890 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-11-09 07:56:03,890 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:56:03,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839031679] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:03,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:56:03,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2024-11-09 07:56:03,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456868460] [2024-11-09 07:56:03,970 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:56:03,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-09 07:56:03,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:56:03,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 07:56:03,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=372, Unknown=1, NotChecked=38, Total=462 [2024-11-09 07:56:03,972 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 15 states have internal predecessors, (40), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 07:56:04,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:56:04,360 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2024-11-09 07:56:04,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 07:56:04,361 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 15 states have internal predecessors, (40), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 30 [2024-11-09 07:56:04,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:56:04,361 INFO L225 Difference]: With dead ends: 77 [2024-11-09 07:56:04,361 INFO L226 Difference]: Without dead ends: 77 [2024-11-09 07:56:04,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=715, Unknown=1, NotChecked=54, Total=870 [2024-11-09 07:56:04,362 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 11 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:56:04,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 532 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 366 Invalid, 0 Unknown, 55 Unchecked, 0.2s Time] [2024-11-09 07:56:04,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-09 07:56:04,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-09 07:56:04,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 72 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-11-09 07:56:04,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2024-11-09 07:56:04,365 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 30 [2024-11-09 07:56:04,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:56:04,365 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2024-11-09 07:56:04,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 15 states have internal predecessors, (40), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 07:56:04,365 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2024-11-09 07:56:04,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 07:56:04,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:56:04,366 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:56:04,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-09 07:56:04,566 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,SelfDestructingSolverStorable17 [2024-11-09 07:56:04,566 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 07:56:04,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:56:04,567 INFO L85 PathProgramCache]: Analyzing trace with hash -486303800, now seen corresponding path program 1 times [2024-11-09 07:56:04,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:56:04,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269391685] [2024-11-09 07:56:04,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:04,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:56:04,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:04,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:56:04,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:04,910 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:56:04,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:56:04,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269391685] [2024-11-09 07:56:04,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269391685] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:04,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138212978] [2024-11-09 07:56:04,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:04,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:56:04,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:56:04,912 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:56:04,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 07:56:04,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:04,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-09 07:56:05,000 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:56:05,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:56:05,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:56:05,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:56:05,183 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:56:05,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:56:05,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:56:05,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:56:05,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:56:05,285 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 11 [2024-11-09 07:56:05,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:56:05,289 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 11 [2024-11-09 07:56:05,350 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:56:05,350 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 17 treesize of output 15 [2024-11-09 07:56:05,354 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:56:05,354 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 17 treesize of output 15 [2024-11-09 07:56:05,415 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:56:05,415 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:56:05,631 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_set_~x#1.offset_25| Int) (v_ArrVal_839 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~l~0#1.offset| |v_ULTIMATE.start_set_~x#1.offset_25|) (forall ((v_ArrVal_842 Int)) (= (select (store (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~data~0#1.base| v_ArrVal_839) |c_ULTIMATE.start_main_~l~0#1.base|) |v_ULTIMATE.start_set_~x#1.offset_25| v_ArrVal_842) 8) 0)))) (forall ((|v_ULTIMATE.start_set_~x#1.offset_25| Int) (v_ArrVal_840 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~l~0#1.offset| |v_ULTIMATE.start_set_~x#1.offset_25|) (forall ((v_ArrVal_844 Int)) (= (select (store (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~data~0#1.base| v_ArrVal_840) |c_ULTIMATE.start_main_~l~0#1.base|) |v_ULTIMATE.start_set_~x#1.offset_25| v_ArrVal_844) 8) 0))))) is different from false [2024-11-09 07:56:06,114 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:56:06,114 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 23 treesize of output 24 [2024-11-09 07:56:06,117 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 38 treesize of output 34 [2024-11-09 07:56:06,125 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:56:06,125 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 32 treesize of output 34 [2024-11-09 07:56:06,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-11-09 07:56:06,166 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:56:06,167 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 23 treesize of output 24 [2024-11-09 07:56:06,168 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:56:06,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2024-11-09 07:56:06,177 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-09 07:56:06,177 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 26 treesize of output 23 [2024-11-09 07:56:06,223 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:56:06,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138212978] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:56:06,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:56:06,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 40 [2024-11-09 07:56:06,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96435309] [2024-11-09 07:56:06,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:56:06,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-09 07:56:06,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:56:06,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-09 07:56:06,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1371, Unknown=7, NotChecked=74, Total=1560 [2024-11-09 07:56:06,225 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand has 40 states, 40 states have (on average 1.525) internal successors, (61), 36 states have internal predecessors, (61), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:56:06,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:56:06,972 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions. [2024-11-09 07:56:06,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-09 07:56:06,973 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.525) internal successors, (61), 36 states have internal predecessors, (61), 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 29 [2024-11-09 07:56:06,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:56:06,973 INFO L225 Difference]: With dead ends: 91 [2024-11-09 07:56:06,973 INFO L226 Difference]: Without dead ends: 91 [2024-11-09 07:56:06,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=188, Invalid=2259, Unknown=7, NotChecked=96, Total=2550 [2024-11-09 07:56:06,974 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 33 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 67 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:56:06,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 520 Invalid, 967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 889 Invalid, 0 Unknown, 67 Unchecked, 0.4s Time] [2024-11-09 07:56:06,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-09 07:56:06,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2024-11-09 07:56:06,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 75 states have (on average 1.24) internal successors, (93), 84 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:56:06,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2024-11-09 07:56:06,977 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 29 [2024-11-09 07:56:06,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:56:06,977 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2024-11-09 07:56:06,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.525) internal successors, (61), 36 states have internal predecessors, (61), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:56:06,977 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2024-11-09 07:56:06,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 07:56:06,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:56:06,978 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:56:06,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-09 07:56:07,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:56:07,179 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 07:56:07,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:56:07,180 INFO L85 PathProgramCache]: Analyzing trace with hash 813438103, now seen corresponding path program 1 times [2024-11-09 07:56:07,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:56:07,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067312061] [2024-11-09 07:56:07,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:07,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:56:07,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:07,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:56:07,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:07,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:56:07,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:56:07,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067312061] [2024-11-09 07:56:07,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067312061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:56:07,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:56:07,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:56:07,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602413223] [2024-11-09 07:56:07,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:56:07,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:56:07,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:56:07,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:56:07,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:56:07,213 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:56:07,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:56:07,243 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2024-11-09 07:56:07,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:56:07,243 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2024-11-09 07:56:07,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:56:07,244 INFO L225 Difference]: With dead ends: 88 [2024-11-09 07:56:07,244 INFO L226 Difference]: Without dead ends: 88 [2024-11-09 07:56:07,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:56:07,245 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 8 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:56:07,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 79 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:56:07,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-09 07:56:07,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-09 07:56:07,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 75 states have (on average 1.2266666666666666) internal successors, (92), 83 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:56:07,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 98 transitions. [2024-11-09 07:56:07,247 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 98 transitions. Word has length 31 [2024-11-09 07:56:07,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:56:07,247 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 98 transitions. [2024-11-09 07:56:07,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:56:07,247 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2024-11-09 07:56:07,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 07:56:07,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:56:07,248 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:56:07,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 07:56:07,248 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 07:56:07,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:56:07,249 INFO L85 PathProgramCache]: Analyzing trace with hash -553222465, now seen corresponding path program 1 times [2024-11-09 07:56:07,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:56:07,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926209905] [2024-11-09 07:56:07,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:07,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:56:07,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:07,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:56:07,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:07,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:56:07,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:56:07,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926209905] [2024-11-09 07:56:07,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926209905] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:07,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097329972] [2024-11-09 07:56:07,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:07,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:56:07,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:56:07,413 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:56:07,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 07:56:07,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:07,502 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 07:56:07,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:56:07,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:56:07,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 07:56:07,546 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:56:07,546 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 13 treesize of output 17 [2024-11-09 07:56:07,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 07:56:07,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:56:07,583 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:56:07,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:56:07,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097329972] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:56:07,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:56:07,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 14 [2024-11-09 07:56:07,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525771564] [2024-11-09 07:56:07,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:56:07,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 07:56:07,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:56:07,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 07:56:07,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2024-11-09 07:56:07,679 INFO L87 Difference]: Start difference. First operand 88 states and 98 transitions. Second operand has 15 states, 14 states have (on average 4.571428571428571) internal successors, (64), 13 states have internal predecessors, (64), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:56:07,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:56:07,839 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2024-11-09 07:56:07,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 07:56:07,839 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.571428571428571) internal successors, (64), 13 states have internal predecessors, (64), 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 32 [2024-11-09 07:56:07,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:56:07,840 INFO L225 Difference]: With dead ends: 90 [2024-11-09 07:56:07,840 INFO L226 Difference]: Without dead ends: 90 [2024-11-09 07:56:07,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2024-11-09 07:56:07,840 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 41 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:56:07,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 163 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:56:07,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-09 07:56:07,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2024-11-09 07:56:07,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 75 states have (on average 1.2133333333333334) internal successors, (91), 82 states have internal predecessors, (91), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:56:07,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2024-11-09 07:56:07,842 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 32 [2024-11-09 07:56:07,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:56:07,843 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2024-11-09 07:56:07,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.571428571428571) internal successors, (64), 13 states have internal predecessors, (64), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:56:07,843 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2024-11-09 07:56:07,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 07:56:07,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:56:07,844 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:56:07,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-09 07:56:08,045 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,SelfDestructingSolverStorable20 [2024-11-09 07:56:08,047 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2024-11-09 07:56:08,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:56:08,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1772028288, now seen corresponding path program 1 times [2024-11-09 07:56:08,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:56:08,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596538758] [2024-11-09 07:56:08,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:08,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:56:08,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:08,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:56:08,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:08,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 07:56:08,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:08,479 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:56:08,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:56:08,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596538758] [2024-11-09 07:56:08,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596538758] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:08,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614665666] [2024-11-09 07:56:08,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:08,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:56:08,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:56:08,482 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:56:08,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-09 07:56:08,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:08,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-09 07:56:08,581 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:56:08,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:56:08,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 07:56:08,701 INFO L349 Elim1Store]: treesize reduction 72, result has 30.1 percent of original size [2024-11-09 07:56:08,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 30 treesize of output 40 [2024-11-09 07:56:08,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2024-11-09 07:56:08,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-09 07:56:08,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-09 07:56:08,800 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:56:08,800 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:56:08,981 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:56:08,981 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 27 treesize of output 28 [2024-11-09 07:56:08,988 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:56:08,988 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 46 treesize of output 45 [2024-11-09 07:56:08,992 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 16 treesize of output 12 [2024-11-09 07:56:09,674 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:56:09,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 460 treesize of output 1054