./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0219.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc 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/test-0219.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-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 32bit --witnessprinter.graph.data.programhash 4a489d3e73f8fa53a32414f65b592ba5db703c103e5e16e188592c7c2dfeab95 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:41:21,314 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:41:21,378 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 06:41:21,383 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:41:21,384 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:41:21,405 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:41:21,405 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:41:21,406 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:41:21,406 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:41:21,406 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:41:21,407 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:41:21,407 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:41:21,407 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:41:21,408 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:41:21,408 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:41:21,408 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:41:21,409 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:41:21,409 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:41:21,409 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:41:21,409 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:41:21,410 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:41:21,414 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:41:21,414 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 06:41:21,414 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:41:21,414 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:41:21,414 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:41:21,414 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:41:21,415 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:41:21,415 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:41:21,415 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:41:21,415 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:41:21,415 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:41:21,415 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:41:21,416 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:41:21,416 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:41:21,416 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:41:21,416 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:41:21,416 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:41:21,416 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:41:21,416 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:41:21,417 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:41:21,421 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:41:21,421 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4a489d3e73f8fa53a32414f65b592ba5db703c103e5e16e188592c7c2dfeab95 [2024-11-19 06:41:21,694 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:41:21,720 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:41:21,723 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:41:21,724 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:41:21,724 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:41:21,725 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0219.i [2024-11-19 06:41:23,155 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:41:23,362 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:41:23,362 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0219.i [2024-11-19 06:41:23,384 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a511ae2c/ac93ef2f375f419592c42233adee5c7a/FLAG14d314a3b [2024-11-19 06:41:23,716 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a511ae2c/ac93ef2f375f419592c42233adee5c7a [2024-11-19 06:41:23,719 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:41:23,720 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:41:23,724 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:41:23,725 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:41:23,729 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:41:23,733 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:41:23" (1/1) ... [2024-11-19 06:41:23,734 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33ca8c00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:23, skipping insertion in model container [2024-11-19 06:41:23,736 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:41:23" (1/1) ... [2024-11-19 06:41:23,780 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:41:24,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:41:24,078 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:41:24,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:41:24,158 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:41:24,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:24 WrapperNode [2024-11-19 06:41:24,159 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:41:24,160 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:41:24,160 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:41:24,160 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:41:24,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:24" (1/1) ... [2024-11-19 06:41:24,177 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:24" (1/1) ... [2024-11-19 06:41:24,202 INFO L138 Inliner]: procedures = 180, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 117 [2024-11-19 06:41:24,203 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:41:24,203 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:41:24,203 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:41:24,203 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:41:24,212 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:24" (1/1) ... [2024-11-19 06:41:24,212 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:24" (1/1) ... [2024-11-19 06:41:24,217 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:24" (1/1) ... [2024-11-19 06:41:24,244 INFO L175 MemorySlicer]: Split 22 memory accesses to 3 slices as follows [2, 8, 12]. 55 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 8 writes are split as follows [0, 2, 6]. [2024-11-19 06:41:24,244 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:24" (1/1) ... [2024-11-19 06:41:24,244 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:24" (1/1) ... [2024-11-19 06:41:24,250 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:24" (1/1) ... [2024-11-19 06:41:24,253 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:24" (1/1) ... [2024-11-19 06:41:24,254 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:24" (1/1) ... [2024-11-19 06:41:24,255 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:24" (1/1) ... [2024-11-19 06:41:24,260 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:41:24,261 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:41:24,261 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:41:24,261 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:41:24,262 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:24" (1/1) ... [2024-11-19 06:41:24,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:41:24,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:41:24,288 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-19 06:41:24,290 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-19 06:41:24,333 INFO L130 BoogieDeclarations]: Found specification of procedure calloc_model [2024-11-19 06:41:24,333 INFO L138 BoogieDeclarations]: Found implementation of procedure calloc_model [2024-11-19 06:41:24,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:41:24,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:41:24,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 06:41:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 06:41:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 06:41:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 06:41:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 06:41:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 06:41:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:41:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-19 06:41:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-19 06:41:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-19 06:41:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 06:41:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 06:41:24,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 06:41:24,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:41:24,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:41:24,477 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:41:24,479 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:41:24,811 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2024-11-19 06:41:24,811 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:41:24,823 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:41:24,823 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-19 06:41:24,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:41:24 BoogieIcfgContainer [2024-11-19 06:41:24,824 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:41:24,825 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:41:24,825 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:41:24,828 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:41:24,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:41:23" (1/3) ... [2024-11-19 06:41:24,829 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e5868dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:41:24, skipping insertion in model container [2024-11-19 06:41:24,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:24" (2/3) ... [2024-11-19 06:41:24,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e5868dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:41:24, skipping insertion in model container [2024-11-19 06:41:24,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:41:24" (3/3) ... [2024-11-19 06:41:24,831 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0219.i [2024-11-19 06:41:24,844 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:41:24,845 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2024-11-19 06:41:24,886 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:41:24,891 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;@7ef66dac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:41:24,892 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2024-11-19 06:41:24,895 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 60 states have (on average 1.9666666666666666) internal successors, (118), 106 states have internal predecessors, (118), 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-19 06:41:24,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-19 06:41:24,900 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:24,900 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-19 06:41:24,901 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:41:24,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:24,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1359048, now seen corresponding path program 1 times [2024-11-19 06:41:24,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:41:24,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243990312] [2024-11-19 06:41:24,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:24,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:41:24,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:25,020 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-19 06:41:25,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:41:25,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243990312] [2024-11-19 06:41:25,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243990312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:25,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:25,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:41:25,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181798673] [2024-11-19 06:41:25,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:25,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 06:41:25,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:41:25,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 06:41:25,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 06:41:25,053 INFO L87 Difference]: Start difference. First operand has 110 states, 60 states have (on average 1.9666666666666666) internal successors, (118), 106 states have internal predecessors, (118), 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 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:41:25,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:25,068 INFO L93 Difference]: Finished difference Result 110 states and 115 transitions. [2024-11-19 06:41:25,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 06:41:25,070 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-19 06:41:25,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:25,076 INFO L225 Difference]: With dead ends: 110 [2024-11-19 06:41:25,077 INFO L226 Difference]: Without dead ends: 108 [2024-11-19 06:41:25,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 06:41:25,081 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:25,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:41:25,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-19 06:41:25,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-19 06:41:25,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 59 states have (on average 1.847457627118644) internal successors, (109), 104 states have internal predecessors, (109), 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-19 06:41:25,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 113 transitions. [2024-11-19 06:41:25,123 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 113 transitions. Word has length 4 [2024-11-19 06:41:25,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:25,124 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 113 transitions. [2024-11-19 06:41:25,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:41:25,124 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2024-11-19 06:41:25,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-19 06:41:25,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:25,125 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 06:41:25,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 06:41:25,126 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:41:25,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:25,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1303851166, now seen corresponding path program 1 times [2024-11-19 06:41:25,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:41:25,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853911077] [2024-11-19 06:41:25,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:25,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:41:25,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:25,265 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-19 06:41:25,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:41:25,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853911077] [2024-11-19 06:41:25,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853911077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:25,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:25,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:41:25,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805800155] [2024-11-19 06:41:25,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:25,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:41:25,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:41:25,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:41:25,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:41:25,270 INFO L87 Difference]: Start difference. First operand 108 states and 113 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-19 06:41:25,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:25,363 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2024-11-19 06:41:25,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:41:25,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2024-11-19 06:41:25,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:25,366 INFO L225 Difference]: With dead ends: 107 [2024-11-19 06:41:25,366 INFO L226 Difference]: Without dead ends: 107 [2024-11-19 06:41:25,366 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-19 06:41:25,368 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 4 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:25,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 168 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:41:25,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-19 06:41:25,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-19 06:41:25,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 59 states have (on average 1.8305084745762712) internal successors, (108), 103 states have internal predecessors, (108), 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-19 06:41:25,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2024-11-19 06:41:25,381 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 6 [2024-11-19 06:41:25,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:25,381 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2024-11-19 06:41:25,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-19 06:41:25,382 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2024-11-19 06:41:25,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-19 06:41:25,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:25,383 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:25,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 06:41:25,383 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:41:25,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:25,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1764680516, now seen corresponding path program 1 times [2024-11-19 06:41:25,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:41:25,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116414847] [2024-11-19 06:41:25,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:25,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:41:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 06:41:25,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1149891507] [2024-11-19 06:41:25,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:25,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:41:25,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:41:25,428 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-19 06:41:25,430 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-19 06:41:25,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:25,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-19 06:41:25,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:41:25,585 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-19 06:41:25,609 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-19 06:41:25,609 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:41:25,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:41:25,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116414847] [2024-11-19 06:41:25,610 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 06:41:25,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149891507] [2024-11-19 06:41:25,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149891507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:25,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:25,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:41:25,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590340192] [2024-11-19 06:41:25,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:25,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:41:25,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:41:25,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:41:25,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:41:25,612 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:41:25,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:25,688 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2024-11-19 06:41:25,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:41:25,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-19 06:41:25,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:25,689 INFO L225 Difference]: With dead ends: 106 [2024-11-19 06:41:25,689 INFO L226 Difference]: Without dead ends: 106 [2024-11-19 06:41:25,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:41:25,691 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 9 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:25,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 271 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:41:25,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-19 06:41:25,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-19 06:41:25,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 59 states have (on average 1.8135593220338984) internal successors, (107), 102 states have internal predecessors, (107), 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-19 06:41:25,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2024-11-19 06:41:25,697 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 7 [2024-11-19 06:41:25,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:25,697 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2024-11-19 06:41:25,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:41:25,697 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2024-11-19 06:41:25,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 06:41:25,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:25,698 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] [2024-11-19 06:41:25,715 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-19 06:41:25,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:41:25,903 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:41:25,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:25,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1861010544, now seen corresponding path program 1 times [2024-11-19 06:41:25,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:41:25,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315773176] [2024-11-19 06:41:25,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:25,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:41:25,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:26,101 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:41:26,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:41:26,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315773176] [2024-11-19 06:41:26,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315773176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:26,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:26,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:41:26,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28107954] [2024-11-19 06:41:26,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:26,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:41:26,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:41:26,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:41:26,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:41:26,105 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:41:26,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:26,223 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2024-11-19 06:41:26,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:41:26,224 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2024-11-19 06:41:26,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:26,225 INFO L225 Difference]: With dead ends: 103 [2024-11-19 06:41:26,225 INFO L226 Difference]: Without dead ends: 103 [2024-11-19 06:41:26,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:41:26,226 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 13 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:26,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 335 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:41:26,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-19 06:41:26,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-19 06:41:26,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 59 states have (on average 1.7627118644067796) internal successors, (104), 99 states have internal predecessors, (104), 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-19 06:41:26,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 108 transitions. [2024-11-19 06:41:26,235 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 108 transitions. Word has length 26 [2024-11-19 06:41:26,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:26,237 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 108 transitions. [2024-11-19 06:41:26,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:41:26,237 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 108 transitions. [2024-11-19 06:41:26,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 06:41:26,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:26,238 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] [2024-11-19 06:41:26,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 06:41:26,239 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:41:26,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:26,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1861010543, now seen corresponding path program 1 times [2024-11-19 06:41:26,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:41:26,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764947749] [2024-11-19 06:41:26,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:26,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:41:26,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 06:41:26,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1641868127] [2024-11-19 06:41:26,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:26,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:41:26,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:41:26,275 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-19 06:41:26,281 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-19 06:41:26,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:26,356 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-19 06:41:26,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:41:26,377 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-19 06:41:26,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2024-11-19 06:41:26,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:41:26,687 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-19 06:41:26,708 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:41:26,709 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-19 06:41:26,724 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:41:26,725 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:41:26,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:41:26,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764947749] [2024-11-19 06:41:26,725 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 06:41:26,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641868127] [2024-11-19 06:41:26,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641868127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:26,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:26,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:41:26,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527502771] [2024-11-19 06:41:26,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:26,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:41:26,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:41:26,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:41:26,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:41:26,728 INFO L87 Difference]: Start difference. First operand 103 states and 108 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:41:27,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:27,020 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2024-11-19 06:41:27,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:41:27,021 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2024-11-19 06:41:27,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:27,022 INFO L225 Difference]: With dead ends: 100 [2024-11-19 06:41:27,022 INFO L226 Difference]: Without dead ends: 100 [2024-11-19 06:41:27,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:41:27,023 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 14 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:27,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 327 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:41:27,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-19 06:41:27,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-19 06:41:27,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 59 states have (on average 1.7118644067796611) internal successors, (101), 96 states have internal predecessors, (101), 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-19 06:41:27,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2024-11-19 06:41:27,035 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 26 [2024-11-19 06:41:27,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:27,035 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2024-11-19 06:41:27,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:41:27,035 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2024-11-19 06:41:27,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 06:41:27,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:27,036 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] [2024-11-19 06:41:27,055 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-19 06:41:27,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:41:27,237 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:41:27,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:27,238 INFO L85 PathProgramCache]: Analyzing trace with hash 384928723, now seen corresponding path program 1 times [2024-11-19 06:41:27,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:41:27,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023089649] [2024-11-19 06:41:27,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:27,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:41:27,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:27,528 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:41:27,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:41:27,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023089649] [2024-11-19 06:41:27,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023089649] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:41:27,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139172182] [2024-11-19 06:41:27,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:27,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:41:27,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:41:27,531 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-19 06:41:27,536 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-19 06:41:27,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:27,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-19 06:41:27,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:41:27,640 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-19 06:41:27,688 WARN L873 $PredicateComparison]: unable to prove that (exists ((|calloc_model_~ptr~0#1.base| Int)) (and (= (select |c_old(#valid)| |calloc_model_~ptr~0#1.base|) 0) (= |c_#valid| (store |c_old(#valid)| |calloc_model_~ptr~0#1.base| (select |c_#valid| |calloc_model_~ptr~0#1.base|))))) is different from true [2024-11-19 06:41:27,736 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-19 06:41:27,736 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-19 06:41:27,751 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-19 06:41:27,752 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-19 06:41:27,768 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-19 06:41:27,769 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:41:27,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139172182] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:41:27,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:41:27,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2024-11-19 06:41:27,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479321259] [2024-11-19 06:41:27,830 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:41:27,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 06:41:27,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:41:27,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 06:41:27,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=108, Unknown=1, NotChecked=20, Total=156 [2024-11-19 06:41:27,832 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 06:41:28,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:28,158 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2024-11-19 06:41:28,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 06:41:28,159 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2024-11-19 06:41:28,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:28,161 INFO L225 Difference]: With dead ends: 101 [2024-11-19 06:41:28,161 INFO L226 Difference]: Without dead ends: 101 [2024-11-19 06:41:28,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=220, Unknown=1, NotChecked=30, Total=306 [2024-11-19 06:41:28,165 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 31 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:28,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 402 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 359 Invalid, 0 Unknown, 102 Unchecked, 0.2s Time] [2024-11-19 06:41:28,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-19 06:41:28,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2024-11-19 06:41:28,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 59 states have (on average 1.6610169491525424) internal successors, (98), 93 states have internal predecessors, (98), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:41:28,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2024-11-19 06:41:28,191 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 30 [2024-11-19 06:41:28,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:28,192 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2024-11-19 06:41:28,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 06:41:28,192 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2024-11-19 06:41:28,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 06:41:28,198 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:28,198 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] [2024-11-19 06:41:28,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 06:41:28,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:41:28,399 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:41:28,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:28,400 INFO L85 PathProgramCache]: Analyzing trace with hash 384928724, now seen corresponding path program 1 times [2024-11-19 06:41:28,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:41:28,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758262328] [2024-11-19 06:41:28,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:28,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:41:28,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:28,688 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:41:28,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:41:28,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758262328] [2024-11-19 06:41:28,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758262328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:28,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:28,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 06:41:28,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789834087] [2024-11-19 06:41:28,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:28,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 06:41:28,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:41:28,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 06:41:28,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:41:28,690 INFO L87 Difference]: Start difference. First operand 97 states and 102 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:41:28,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:28,858 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2024-11-19 06:41:28,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:41:28,858 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-11-19 06:41:28,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:28,859 INFO L225 Difference]: With dead ends: 105 [2024-11-19 06:41:28,859 INFO L226 Difference]: Without dead ends: 101 [2024-11-19 06:41:28,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:41:28,860 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 4 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:28,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 327 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:41:28,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-19 06:41:28,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-19 06:41:28,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 62 states have (on average 1.6451612903225807) internal successors, (102), 97 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 06:41:28,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2024-11-19 06:41:28,865 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 30 [2024-11-19 06:41:28,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:28,865 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2024-11-19 06:41:28,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:41:28,865 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2024-11-19 06:41:28,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 06:41:28,866 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:28,866 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] [2024-11-19 06:41:28,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 06:41:28,866 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:41:28,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:28,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1169041418, now seen corresponding path program 1 times [2024-11-19 06:41:28,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:41:28,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307536030] [2024-11-19 06:41:28,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:28,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:41:28,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:29,226 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:41:29,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:41:29,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307536030] [2024-11-19 06:41:29,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307536030] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:41:29,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476507005] [2024-11-19 06:41:29,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:29,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:41:29,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:41:29,228 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-19 06:41:29,229 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-19 06:41:29,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:29,327 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-19 06:41:29,329 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:41:29,337 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-19 06:41:29,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2024-11-19 06:41:31,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:41:31,234 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 18 treesize of output 13 [2024-11-19 06:41:31,241 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:41:31,241 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-19 06:41:31,308 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:41:31,308 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:41:43,938 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:41:43,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476507005] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:41:43,939 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:41:43,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 27 [2024-11-19 06:41:43,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844471967] [2024-11-19 06:41:43,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:41:43,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-19 06:41:43,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:41:43,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-19 06:41:43,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=600, Unknown=3, NotChecked=0, Total=702 [2024-11-19 06:41:43,941 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand has 27 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 24 states have internal predecessors, (49), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 06:41:48,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.54s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-19 06:41:53,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-19 06:41:57,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:57,628 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2024-11-19 06:41:57,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-19 06:41:57,629 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 24 states have internal predecessors, (49), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2024-11-19 06:41:57,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:57,629 INFO L225 Difference]: With dead ends: 118 [2024-11-19 06:41:57,629 INFO L226 Difference]: Without dead ends: 110 [2024-11-19 06:41:57,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=175, Invalid=1012, Unknown=3, NotChecked=0, Total=1190 [2024-11-19 06:41:57,630 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 9 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:57,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 740 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 926 Invalid, 2 Unknown, 0 Unchecked, 12.1s Time] [2024-11-19 06:41:57,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-19 06:41:57,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 104. [2024-11-19 06:41:57,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 65 states have (on average 1.6615384615384616) internal successors, (108), 100 states have internal predecessors, (108), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 06:41:57,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2024-11-19 06:41:57,634 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 31 [2024-11-19 06:41:57,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:57,634 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2024-11-19 06:41:57,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 24 states have internal predecessors, (49), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 06:41:57,634 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2024-11-19 06:41:57,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-19 06:41:57,635 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:57,635 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:57,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 06:41:57,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:41:57,836 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:41:57,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:57,836 INFO L85 PathProgramCache]: Analyzing trace with hash 313820244, now seen corresponding path program 2 times [2024-11-19 06:41:57,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:41:57,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610508859] [2024-11-19 06:41:57,836 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:41:57,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:41:57,876 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:41:57,877 INFO L228 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-19 06:41:57,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1226796138] [2024-11-19 06:41:57,878 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:41:57,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:41:57,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:41:57,880 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-19 06:41:57,884 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-19 06:41:58,044 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:41:58,045 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:41:58,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-19 06:41:58,051 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:41:58,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2024-11-19 06:41:58,158 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-19 06:41:59,353 WARN L873 $PredicateComparison]: unable to prove that (exists ((|calloc_model_~ptr~0#1.base| Int)) (and (= (select |c_old(#valid)| |calloc_model_~ptr~0#1.base|) 0) (= (store |c_old(#length)| |calloc_model_~ptr~0#1.base| (select |c_#length| |calloc_model_~ptr~0#1.base|)) |c_#length|) (= |c_#valid| (store |c_old(#valid)| |calloc_model_~ptr~0#1.base| (select |c_#valid| |calloc_model_~ptr~0#1.base|))))) is different from true [2024-11-19 06:41:59,577 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-19 06:41:59,578 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-19 06:41:59,596 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-19 06:41:59,690 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-19 06:41:59,691 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 14 treesize of output 13 [2024-11-19 06:41:59,736 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:41:59,736 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-19 06:41:59,971 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 11 not checked. [2024-11-19 06:41:59,971 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:42:00,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:42:00,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610508859] [2024-11-19 06:42:00,892 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 06:42:00,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226796138] [2024-11-19 06:42:00,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226796138] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:42:00,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-19 06:42:00,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2024-11-19 06:42:00,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468221506] [2024-11-19 06:42:00,893 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-19 06:42:00,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 06:42:00,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:42:00,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 06:42:00,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=152, Unknown=1, NotChecked=24, Total=210 [2024-11-19 06:42:00,895 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. Second operand has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:42:02,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:42:02,774 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2024-11-19 06:42:02,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 06:42:02,776 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2024-11-19 06:42:02,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:42:02,778 INFO L225 Difference]: With dead ends: 101 [2024-11-19 06:42:02,778 INFO L226 Difference]: Without dead ends: 101 [2024-11-19 06:42:02,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=67, Invalid=316, Unknown=1, NotChecked=36, Total=420 [2024-11-19 06:42:02,780 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 37 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:42:02,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 423 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 511 Invalid, 0 Unknown, 95 Unchecked, 1.3s Time] [2024-11-19 06:42:02,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-19 06:42:02,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-19 06:42:02,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 65 states have (on average 1.6153846153846154) internal successors, (105), 97 states have internal predecessors, (105), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 06:42:02,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2024-11-19 06:42:02,790 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 34 [2024-11-19 06:42:02,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:42:02,790 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2024-11-19 06:42:02,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:42:02,794 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2024-11-19 06:42:02,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-19 06:42:02,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:42:02,795 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:42:02,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-19 06:42:02,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:42:02,996 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:42:02,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:42:02,997 INFO L85 PathProgramCache]: Analyzing trace with hash -852525999, now seen corresponding path program 1 times [2024-11-19 06:42:02,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:42:02,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668855537] [2024-11-19 06:42:02,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:42:02,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:42:03,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:42:04,014 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-19 06:42:04,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:42:04,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668855537] [2024-11-19 06:42:04,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668855537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:42:04,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:42:04,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-19 06:42:04,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698950113] [2024-11-19 06:42:04,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:42:04,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 06:42:04,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:42:04,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 06:42:04,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-11-19 06:42:04,017 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 15 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 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-19 06:42:05,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:42:05,056 INFO L93 Difference]: Finished difference Result 124 states and 133 transitions. [2024-11-19 06:42:05,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:42:05,057 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 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) Word has length 41 [2024-11-19 06:42:05,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:42:05,058 INFO L225 Difference]: With dead ends: 124 [2024-11-19 06:42:05,058 INFO L226 Difference]: Without dead ends: 124 [2024-11-19 06:42:05,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2024-11-19 06:42:05,058 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 140 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:42:05,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 460 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 06:42:05,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-19 06:42:05,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 103. [2024-11-19 06:42:05,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 69 states have (on average 1.608695652173913) internal successors, (111), 99 states have internal predecessors, (111), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 06:42:05,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2024-11-19 06:42:05,062 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 41 [2024-11-19 06:42:05,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:42:05,062 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2024-11-19 06:42:05,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 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-19 06:42:05,062 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2024-11-19 06:42:05,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-19 06:42:05,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:42:05,063 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:42:05,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 06:42:05,063 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:42:05,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:42:05,063 INFO L85 PathProgramCache]: Analyzing trace with hash -852525998, now seen corresponding path program 1 times [2024-11-19 06:42:05,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:42:05,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830055466] [2024-11-19 06:42:05,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:42:05,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:42:05,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:42:06,358 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-19 06:42:06,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:42:06,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830055466] [2024-11-19 06:42:06,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830055466] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:42:06,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761002506] [2024-11-19 06:42:06,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:42:06,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:42:06,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:42:06,364 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-19 06:42:06,367 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-19 06:42:06,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:42:06,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-19 06:42:06,476 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:42:06,681 WARN L873 $PredicateComparison]: unable to prove that (exists ((|calloc_model_~ptr~0#1.base| Int)) (and (= (select |c_old(#valid)| |calloc_model_~ptr~0#1.base|) 0) (= (store |c_old(#length)| |calloc_model_~ptr~0#1.base| (select |c_#length| |calloc_model_~ptr~0#1.base|)) |c_#length|) (= |c_#valid| (store |c_old(#valid)| |calloc_model_~ptr~0#1.base| (select |c_#valid| |calloc_model_~ptr~0#1.base|))))) is different from true [2024-11-19 06:42:06,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:42:06,831 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-19 06:42:06,936 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-19 06:42:06,936 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-19 06:42:07,071 WARN L873 $PredicateComparison]: unable to prove that (exists ((|calloc_model_~ptr~0#1.base| Int)) (and (= (select |c_old(#valid)| |calloc_model_~ptr~0#1.base|) 0) (= (store |c_old(#length)| |calloc_model_~ptr~0#1.base| (select |c_#length| |calloc_model_~ptr~0#1.base|)) |c_#length|))) is different from true [2024-11-19 06:42:07,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:42:07,198 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-19 06:42:07,350 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-19 06:42:07,351 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 14 treesize of output 13 [2024-11-19 06:42:07,650 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 10 not checked. [2024-11-19 06:42:07,651 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:42:08,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761002506] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:42:08,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:42:08,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 21 [2024-11-19 06:42:08,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171233712] [2024-11-19 06:42:08,244 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:42:08,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-19 06:42:08,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:42:08,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-19 06:42:08,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=476, Unknown=2, NotChecked=90, Total=650 [2024-11-19 06:42:08,245 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand has 23 states, 22 states have (on average 3.090909090909091) internal successors, (68), 18 states have internal predecessors, (68), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:42:10,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:42:10,203 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2024-11-19 06:42:10,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 06:42:10,204 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.090909090909091) internal successors, (68), 18 states have internal predecessors, (68), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2024-11-19 06:42:10,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:42:10,206 INFO L225 Difference]: With dead ends: 125 [2024-11-19 06:42:10,206 INFO L226 Difference]: Without dead ends: 125 [2024-11-19 06:42:10,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=211, Invalid=985, Unknown=2, NotChecked=134, Total=1332 [2024-11-19 06:42:10,208 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 157 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 235 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:42:10,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 555 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 740 Invalid, 0 Unknown, 235 Unchecked, 1.2s Time] [2024-11-19 06:42:10,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-19 06:42:10,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 101. [2024-11-19 06:42:10,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 69 states have (on average 1.5507246376811594) internal successors, (107), 97 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 06:42:10,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 112 transitions. [2024-11-19 06:42:10,217 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 112 transitions. Word has length 41 [2024-11-19 06:42:10,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:42:10,217 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 112 transitions. [2024-11-19 06:42:10,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.090909090909091) internal successors, (68), 18 states have internal predecessors, (68), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:42:10,217 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 112 transitions. [2024-11-19 06:42:10,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-19 06:42:10,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:42:10,218 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:42:10,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-19 06:42:10,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:42:10,419 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:42:10,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:42:10,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1009259326, now seen corresponding path program 1 times [2024-11-19 06:42:10,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:42:10,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567935962] [2024-11-19 06:42:10,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:42:10,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:42:10,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:42:10,691 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-19 06:42:10,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:42:10,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567935962] [2024-11-19 06:42:10,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567935962] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:42:10,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:42:10,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:42:10,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272373375] [2024-11-19 06:42:10,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:42:10,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:42:10,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:42:10,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:42:10,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:42:10,693 INFO L87 Difference]: Start difference. First operand 101 states and 112 transitions. Second operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:42:11,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:42:11,370 INFO L93 Difference]: Finished difference Result 157 states and 173 transitions. [2024-11-19 06:42:11,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:42:11,370 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2024-11-19 06:42:11,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:42:11,371 INFO L225 Difference]: With dead ends: 157 [2024-11-19 06:42:11,371 INFO L226 Difference]: Without dead ends: 157 [2024-11-19 06:42:11,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:42:11,372 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 52 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 06:42:11,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 276 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 06:42:11,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-19 06:42:11,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 101. [2024-11-19 06:42:11,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 69 states have (on average 1.536231884057971) internal successors, (106), 97 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 06:42:11,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2024-11-19 06:42:11,375 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 49 [2024-11-19 06:42:11,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:42:11,375 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2024-11-19 06:42:11,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:42:11,375 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2024-11-19 06:42:11,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-19 06:42:11,376 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:42:11,376 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:42:11,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 06:42:11,376 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:42:11,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:42:11,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1009259327, now seen corresponding path program 1 times [2024-11-19 06:42:11,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:42:11,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301338973] [2024-11-19 06:42:11,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:42:11,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:42:11,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:42:11,938 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 06:42:11,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:42:11,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301338973] [2024-11-19 06:42:11,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301338973] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:42:11,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139058483] [2024-11-19 06:42:11,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:42:11,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:42:11,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:42:11,941 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-19 06:42:11,942 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-19 06:42:12,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:42:12,061 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-19 06:42:12,066 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:42:13,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:42:13,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:42:14,032 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:42:14,033 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-19 06:42:14,042 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:42:14,043 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-19 06:42:14,106 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 06:42:14,106 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:42:14,301 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 60 treesize of output 56 [2024-11-19 06:42:14,307 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 90 treesize of output 82 [2024-11-19 06:42:14,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:42:14,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:42:14,758 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:42:14,758 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 25 treesize of output 29 [2024-11-19 06:42:16,004 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 06:42:16,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139058483] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:42:16,005 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:42:16,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 12] total 31 [2024-11-19 06:42:16,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989483213] [2024-11-19 06:42:16,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:42:16,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-19 06:42:16,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:42:16,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-19 06:42:16,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=856, Unknown=0, NotChecked=0, Total=992 [2024-11-19 06:42:16,007 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand has 32 states, 28 states have (on average 4.25) internal successors, (119), 29 states have internal predecessors, (119), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 06:42:18,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:42:18,132 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2024-11-19 06:42:18,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 06:42:18,133 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 28 states have (on average 4.25) internal successors, (119), 29 states have internal predecessors, (119), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 49 [2024-11-19 06:42:18,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:42:18,133 INFO L225 Difference]: With dead ends: 143 [2024-11-19 06:42:18,133 INFO L226 Difference]: Without dead ends: 143 [2024-11-19 06:42:18,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=278, Invalid=1614, Unknown=0, NotChecked=0, Total=1892 [2024-11-19 06:42:18,134 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 209 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:42:18,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 878 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-19 06:42:18,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-19 06:42:18,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 101. [2024-11-19 06:42:18,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 69 states have (on average 1.5217391304347827) internal successors, (105), 97 states have internal predecessors, (105), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 06:42:18,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2024-11-19 06:42:18,137 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 49 [2024-11-19 06:42:18,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:42:18,137 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2024-11-19 06:42:18,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 28 states have (on average 4.25) internal successors, (119), 29 states have internal predecessors, (119), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 06:42:18,137 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2024-11-19 06:42:18,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-19 06:42:18,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:42:18,138 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:42:18,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-19 06:42:18,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:42:18,346 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:42:18,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:42:18,347 INFO L85 PathProgramCache]: Analyzing trace with hash 2073584370, now seen corresponding path program 1 times [2024-11-19 06:42:18,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:42:18,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926381305] [2024-11-19 06:42:18,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:42:18,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:42:18,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:42:19,504 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 06:42:19,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:42:19,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926381305] [2024-11-19 06:42:19,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926381305] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:42:19,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164739565] [2024-11-19 06:42:19,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:42:19,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:42:19,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:42:19,507 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-19 06:42:19,508 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-19 06:42:19,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:42:19,627 INFO L255 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-19 06:42:19,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:42:20,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:42:21,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:42:21,677 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:42:21,678 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-19 06:42:21,685 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:42:21,686 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-19 06:42:21,695 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-19 06:42:21,696 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:42:21,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164739565] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:42:21,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 06:42:21,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [14] total 22 [2024-11-19 06:42:21,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106355287] [2024-11-19 06:42:21,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:42:21,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 06:42:21,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:42:21,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 06:42:21,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2024-11-19 06:42:21,697 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 11 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 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-19 06:42:22,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:42:22,671 INFO L93 Difference]: Finished difference Result 142 states and 155 transitions. [2024-11-19 06:42:22,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 06:42:22,672 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 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) Word has length 52 [2024-11-19 06:42:22,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:42:22,673 INFO L225 Difference]: With dead ends: 142 [2024-11-19 06:42:22,673 INFO L226 Difference]: Without dead ends: 142 [2024-11-19 06:42:22,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2024-11-19 06:42:22,673 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 102 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 06:42:22,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 316 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 06:42:22,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-19 06:42:22,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 102. [2024-11-19 06:42:22,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 70 states have (on average 1.5285714285714285) internal successors, (107), 98 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 06:42:22,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2024-11-19 06:42:22,684 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 52 [2024-11-19 06:42:22,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:42:22,684 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2024-11-19 06:42:22,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 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-19 06:42:22,684 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2024-11-19 06:42:22,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-19 06:42:22,685 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:42:22,685 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:42:22,701 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-19 06:42:22,885 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,SelfDestructingSolverStorable13 [2024-11-19 06:42:22,886 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:42:22,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:42:22,886 INFO L85 PathProgramCache]: Analyzing trace with hash 2073584369, now seen corresponding path program 1 times [2024-11-19 06:42:22,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:42:22,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803794747] [2024-11-19 06:42:22,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:42:22,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:42:22,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:42:23,011 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-19 06:42:23,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:42:23,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803794747] [2024-11-19 06:42:23,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803794747] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:42:23,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:42:23,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:42:23,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751715176] [2024-11-19 06:42:23,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:42:23,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:42:23,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:42:23,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:42:23,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:42:23,013 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:42:23,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:42:23,272 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2024-11-19 06:42:23,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:42:23,273 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 52 [2024-11-19 06:42:23,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:42:23,273 INFO L225 Difference]: With dead ends: 114 [2024-11-19 06:42:23,273 INFO L226 Difference]: Without dead ends: 114 [2024-11-19 06:42:23,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:42:23,275 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 18 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:42:23,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 240 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:42:23,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-19 06:42:23,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 101. [2024-11-19 06:42:23,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 70 states have (on average 1.5) internal successors, (105), 97 states have internal predecessors, (105), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 06:42:23,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2024-11-19 06:42:23,278 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 52 [2024-11-19 06:42:23,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:42:23,279 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2024-11-19 06:42:23,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:42:23,280 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2024-11-19 06:42:23,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-19 06:42:23,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:42:23,280 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:42:23,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 06:42:23,281 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:42:23,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:42:23,281 INFO L85 PathProgramCache]: Analyzing trace with hash -150244075, now seen corresponding path program 1 times [2024-11-19 06:42:23,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:42:23,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433226040] [2024-11-19 06:42:23,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:42:23,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:42:23,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:42:24,527 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:42:24,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:42:24,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433226040] [2024-11-19 06:42:24,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433226040] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:42:24,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054710049] [2024-11-19 06:42:24,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:42:24,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:42:24,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:42:24,530 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-19 06:42:24,531 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-19 06:42:24,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:42:24,656 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-19 06:42:24,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:42:25,772 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-19 06:42:26,235 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-19 06:42:26,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:42:26,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:42:26,772 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:42:26,776 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-11-19 06:42:26,789 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:42:26,789 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-19 06:42:26,890 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-19 06:42:27,061 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-19 06:42:27,061 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:42:27,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054710049] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:42:27,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 06:42:27,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 25 [2024-11-19 06:42:27,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544764875] [2024-11-19 06:42:27,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:42:27,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 06:42:27,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:42:27,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 06:42:27,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2024-11-19 06:42:27,063 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 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-19 06:42:28,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:42:28,741 INFO L93 Difference]: Finished difference Result 127 states and 141 transitions. [2024-11-19 06:42:28,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 06:42:28,741 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 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) Word has length 54 [2024-11-19 06:42:28,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:42:28,742 INFO L225 Difference]: With dead ends: 127 [2024-11-19 06:42:28,742 INFO L226 Difference]: Without dead ends: 127 [2024-11-19 06:42:28,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=108, Invalid=884, Unknown=0, NotChecked=0, Total=992 [2024-11-19 06:42:28,743 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 110 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:42:28,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 413 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-19 06:42:28,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-19 06:42:28,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 102. [2024-11-19 06:42:28,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 72 states have (on average 1.4861111111111112) internal successors, (107), 98 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 06:42:28,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2024-11-19 06:42:28,747 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 54 [2024-11-19 06:42:28,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:42:28,747 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2024-11-19 06:42:28,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 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-19 06:42:28,748 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2024-11-19 06:42:28,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-19 06:42:28,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:42:28,748 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:42:28,764 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-19 06:42:28,952 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,SelfDestructingSolverStorable15 [2024-11-19 06:42:28,953 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:42:28,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:42:28,954 INFO L85 PathProgramCache]: Analyzing trace with hash -150244074, now seen corresponding path program 1 times [2024-11-19 06:42:28,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:42:28,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408956968] [2024-11-19 06:42:28,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:42:28,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:42:28,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:42:30,290 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:42:30,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:42:30,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408956968] [2024-11-19 06:42:30,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408956968] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:42:30,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769896342] [2024-11-19 06:42:30,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:42:30,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:42:30,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:42:30,293 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-19 06:42:30,295 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-19 06:42:30,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:42:30,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-11-19 06:42:30,453 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:42:32,403 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-19 06:42:32,425 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-19 06:42:33,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2024-11-19 06:42:33,060 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 44 treesize of output 26 [2024-11-19 06:42:33,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:42:33,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:42:33,896 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:42:33,897 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2024-11-19 06:42:33,921 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:42:33,922 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 38 [2024-11-19 06:42:34,088 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 23 treesize of output 15 [2024-11-19 06:42:34,093 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 26 treesize of output 14 [2024-11-19 06:42:34,351 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 06:42:34,351 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:42:35,449 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 181 treesize of output 169 [2024-11-19 06:42:35,455 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 281 treesize of output 253 [2024-11-19 06:42:41,036 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_~#list~0.base| |c_ULTIMATE.start_l1_insert_~list#1.base|)) (.cse1 (= |c_~#list~0.offset| |c_ULTIMATE.start_l1_insert_~list#1.offset|))) (or (and .cse0 (<= (+ |c_ULTIMATE.start_l1_insert_~item~1#1.offset| 1) 0) .cse1) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_l1_insert_~item~1#1.base|)) (.cse4 (+ |c_ULTIMATE.start_l1_insert_~item~1#1.offset| 4)) (.cse5 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_l1_insert_~item~1#1.base|)) (.cse2 (and .cse0 .cse1))) (and (or .cse2 (let ((.cse3 (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_40 Int) (v_arrayElimCell_39 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.offset| Int)) (or (let ((.cse8 (+ 4 v_arrayElimCell_40))) (< (+ 7 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse5 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| |ULTIMATE.start_l1_insert_#t~mem13#1.offset|)) v_arrayElimCell_39) .cse8)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse7 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| |ULTIMATE.start_l1_insert_#t~mem13#1.base|)) v_arrayElimCell_39) .cse8)))) (< v_arrayElimCell_40 0))))) (and (or .cse0 .cse3) (or .cse1 .cse3) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_40 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.offset| Int)) (or (forall ((v_arrayElimCell_39 Int)) (or (< (+ (select (select |c_#memory_$Pointer$#2.offset| v_arrayElimCell_39) .cse4) 7) (select |c_#length| (select (select |c_#memory_$Pointer$#2.base| v_arrayElimCell_39) .cse4))) (let ((.cse6 (+ 4 v_arrayElimCell_40))) (< (+ 7 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse5 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| |ULTIMATE.start_l1_insert_#t~mem13#1.offset|)) v_arrayElimCell_39) .cse6)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse7 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| |ULTIMATE.start_l1_insert_#t~mem13#1.base|)) v_arrayElimCell_39) .cse6)))))) (< v_arrayElimCell_40 0)))))) (or (let ((.cse9 (select .cse5 .cse4))) (and (<= 0 (+ .cse9 4)) (<= (+ .cse9 8) (select |c_#length| (select .cse7 .cse4))))) (not .cse1) (not .cse0)) (or (let ((.cse10 (forall ((v_arrayElimCell_40 Int) (v_arrayElimCell_39 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.offset| Int)) (or (< 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse5 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| |ULTIMATE.start_l1_insert_#t~mem13#1.offset|)) v_arrayElimCell_39) (+ 4 v_arrayElimCell_40)) 5)) (< v_arrayElimCell_40 0))))) (and (forall ((v_arrayElimCell_40 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.offset| Int)) (or (forall ((v_arrayElimCell_39 Int)) (or (< 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse5 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| |ULTIMATE.start_l1_insert_#t~mem13#1.offset|)) v_arrayElimCell_39) (+ 4 v_arrayElimCell_40)) 5)) (< 0 (+ (select (select |c_#memory_$Pointer$#2.offset| v_arrayElimCell_39) .cse4) 5)))) (< v_arrayElimCell_40 0))) (or .cse0 .cse10) (or .cse1 .cse10))) .cse2))))) is different from false [2024-11-19 06:42:47,199 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 462 treesize of output 450 [2024-11-19 06:42:47,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 697 treesize of output 661 [2024-11-19 06:42:47,390 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 462 treesize of output 450 [2024-11-19 06:42:47,409 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 697 treesize of output 661 [2024-11-19 06:42:47,612 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 32 [2024-11-19 06:42:47,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:42:47,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:42:47,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:42:47,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:42:47,999 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 7 treesize of output 5 [2024-11-19 06:42:54,490 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 06:42:54,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769896342] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 06:42:54,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:42:54,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [15, 20] total 52 [2024-11-19 06:42:54,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482812150] [2024-11-19 06:42:54,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:42:54,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-19 06:42:54,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:42:54,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-19 06:42:54,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=2332, Unknown=3, NotChecked=98, Total=2652 [2024-11-19 06:42:54,493 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand has 19 states, 17 states have (on average 2.764705882352941) internal successors, (47), 18 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:43:00,503 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse18 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_l1_insert_~item~1#1.base|)) (.cse16 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_l1_insert_~item~1#1.base|)) (.cse8 (+ |c_ULTIMATE.start_l1_insert_~item~1#1.offset| 4)) (.cse11 (= |c_~#list~0.offset| |c_ULTIMATE.start_l1_insert_~list#1.offset|)) (.cse9 (= |c_~#list~0.base| |c_ULTIMATE.start_l1_insert_~list#1.base|))) (let ((.cse4 (or (let ((.cse21 (select .cse16 .cse8))) (and (<= 0 (+ .cse21 4)) (<= (+ .cse21 8) (select |c_#length| (select .cse18 .cse8))))) (not .cse11) (not .cse9))) (.cse0 (and .cse9 .cse11))) (let ((.cse1 (< |c_ULTIMATE.start_l1_insert_~list#1.offset| 0)) (.cse3 (and (or .cse0 (let ((.cse15 (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_40 Int) (v_arrayElimCell_39 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.offset| Int)) (or (let ((.cse19 (+ 4 v_arrayElimCell_40))) (< (+ 7 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse16 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| |ULTIMATE.start_l1_insert_#t~mem13#1.offset|)) v_arrayElimCell_39) .cse19)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse18 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| |ULTIMATE.start_l1_insert_#t~mem13#1.base|)) v_arrayElimCell_39) .cse19)))) (< v_arrayElimCell_40 0))))) (and (or .cse9 .cse15) (or .cse11 .cse15) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_40 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.offset| Int)) (or (forall ((v_arrayElimCell_39 Int)) (or (< (+ (select (select |c_#memory_$Pointer$#2.offset| v_arrayElimCell_39) .cse8) 7) (select |c_#length| (select (select |c_#memory_$Pointer$#2.base| v_arrayElimCell_39) .cse8))) (let ((.cse17 (+ 4 v_arrayElimCell_40))) (< (+ 7 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse16 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| |ULTIMATE.start_l1_insert_#t~mem13#1.offset|)) v_arrayElimCell_39) .cse17)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse18 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| |ULTIMATE.start_l1_insert_#t~mem13#1.base|)) v_arrayElimCell_39) .cse17)))))) (< v_arrayElimCell_40 0)))))) .cse4 (or (let ((.cse20 (forall ((v_arrayElimCell_40 Int) (v_arrayElimCell_39 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.offset| Int)) (or (< 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse16 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| |ULTIMATE.start_l1_insert_#t~mem13#1.offset|)) v_arrayElimCell_39) (+ 4 v_arrayElimCell_40)) 5)) (< v_arrayElimCell_40 0))))) (and (forall ((v_arrayElimCell_40 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.offset| Int)) (or (forall ((v_arrayElimCell_39 Int)) (or (< 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse16 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| |ULTIMATE.start_l1_insert_#t~mem13#1.offset|)) v_arrayElimCell_39) (+ 4 v_arrayElimCell_40)) 5)) (< 0 (+ (select (select |c_#memory_$Pointer$#2.offset| v_arrayElimCell_39) .cse8) 5)))) (< v_arrayElimCell_40 0))) (or .cse9 .cse20) (or .cse11 .cse20))) .cse0))) (.cse2 (and .cse9 (<= (+ |c_ULTIMATE.start_l1_insert_~item~1#1.offset| 1) 0) .cse11))) (and (or .cse0 .cse1) (or .cse2 .cse3) (or .cse2 .cse1 .cse3) (< |c_~#list~0.offset| 1) (or .cse2 (and .cse4 (or (let ((.cse10 (forall ((v_arrayElimCell_40 Int) (v_arrayElimCell_39 Int)) (or (let ((.cse12 (+ 4 v_arrayElimCell_40))) (< (+ 7 (select (select |c_#memory_$Pointer$#2.offset| v_arrayElimCell_39) .cse12)) (select |c_#length| (select (select |c_#memory_$Pointer$#2.base| v_arrayElimCell_39) .cse12)))) (< v_arrayElimCell_40 0))))) (and (forall ((v_arrayElimCell_40 Int)) (or (forall ((v_arrayElimCell_39 Int)) (let ((.cse5 (select |c_#memory_$Pointer$#2.offset| v_arrayElimCell_39)) (.cse7 (select |c_#memory_$Pointer$#2.base| v_arrayElimCell_39))) (or (let ((.cse6 (+ 4 v_arrayElimCell_40))) (< (+ 7 (select .cse5 .cse6)) (select |c_#length| (select .cse7 .cse6)))) (< (+ (select .cse5 .cse8) 7) (select |c_#length| (select .cse7 .cse8)))))) (< v_arrayElimCell_40 0))) (or .cse9 .cse10) (or .cse10 .cse11))) .cse0) (or (let ((.cse14 (forall ((v_arrayElimCell_40 Int) (v_arrayElimCell_39 Int)) (or (< v_arrayElimCell_40 0) (< 0 (+ (select (select |c_#memory_$Pointer$#2.offset| v_arrayElimCell_39) (+ 4 v_arrayElimCell_40)) 5)))))) (and (forall ((v_arrayElimCell_40 Int)) (or (forall ((v_arrayElimCell_39 Int)) (let ((.cse13 (select |c_#memory_$Pointer$#2.offset| v_arrayElimCell_39))) (or (< 0 (+ (select .cse13 .cse8) 5)) (< 0 (+ (select .cse13 (+ 4 v_arrayElimCell_40)) 5))))) (< v_arrayElimCell_40 0))) (or .cse9 .cse14) (or .cse11 .cse14))) .cse0))))))) is different from false