./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/duplets.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/duplets.c -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 ac76721ba91522692e2c3e4d1ea27df0200031dd012c5066cc7280e0ae6e2244 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:36:22,152 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:36:22,230 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 10:36:22,235 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:36:22,235 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:36:22,266 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:36:22,267 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:36:22,267 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:36:22,268 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:36:22,268 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:36:22,269 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:36:22,269 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:36:22,270 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:36:22,272 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:36:22,272 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:36:22,272 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:36:22,273 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:36:22,273 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:36:22,273 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:36:22,273 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:36:22,274 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:36:22,277 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:36:22,277 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 10:36:22,277 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:36:22,278 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:36:22,278 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:36:22,278 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:36:22,278 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:36:22,278 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:36:22,279 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:36:22,279 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:36:22,279 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:36:22,279 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:36:22,280 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:36:22,280 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:36:22,282 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:36:22,283 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 10:36:22,283 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 10:36:22,283 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:36:22,283 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:36:22,283 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:36:22,284 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:36:22,284 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 -> ac76721ba91522692e2c3e4d1ea27df0200031dd012c5066cc7280e0ae6e2244 [2024-10-13 10:36:22,550 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:36:22,576 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:36:22,579 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:36:22,580 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:36:22,581 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:36:22,582 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/duplets.c [2024-10-13 10:36:24,146 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:36:24,379 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:36:24,379 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/duplets.c [2024-10-13 10:36:24,394 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35da8699e/9917d41de3404110b8ea6bd5e5b46ee1/FLAGbb50690b1 [2024-10-13 10:36:24,409 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35da8699e/9917d41de3404110b8ea6bd5e5b46ee1 [2024-10-13 10:36:24,412 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:36:24,413 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:36:24,416 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:36:24,416 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:36:24,421 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:36:24,422 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:36:24" (1/1) ... [2024-10-13 10:36:24,423 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5179a586 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:36:24, skipping insertion in model container [2024-10-13 10:36:24,423 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:36:24" (1/1) ... [2024-10-13 10:36:24,446 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:36:24,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:36:24,688 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 10:36:24,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:36:24,731 INFO L204 MainTranslator]: Completed translation [2024-10-13 10:36:24,731 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:36:24 WrapperNode [2024-10-13 10:36:24,731 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:36:24,733 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 10:36:24,733 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 10:36:24,733 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 10:36:24,743 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:36:24" (1/1) ... [2024-10-13 10:36:24,750 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:36:24" (1/1) ... [2024-10-13 10:36:24,770 INFO L138 Inliner]: procedures = 21, calls = 44, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 132 [2024-10-13 10:36:24,771 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 10:36:24,772 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 10:36:24,772 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 10:36:24,772 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 10:36:24,782 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:36:24" (1/1) ... [2024-10-13 10:36:24,783 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:36:24" (1/1) ... [2024-10-13 10:36:24,786 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:36:24" (1/1) ... [2024-10-13 10:36:24,800 INFO L175 MemorySlicer]: Split 19 memory accesses to 4 slices as follows [2, 5, 5, 7]. 37 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 5 writes are split as follows [0, 1, 1, 3]. [2024-10-13 10:36:24,800 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:36:24" (1/1) ... [2024-10-13 10:36:24,801 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:36:24" (1/1) ... [2024-10-13 10:36:24,807 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:36:24" (1/1) ... [2024-10-13 10:36:24,810 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:36:24" (1/1) ... [2024-10-13 10:36:24,814 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:36:24" (1/1) ... [2024-10-13 10:36:24,815 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:36:24" (1/1) ... [2024-10-13 10:36:24,818 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 10:36:24,819 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 10:36:24,819 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 10:36:24,819 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 10:36:24,820 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:36:24" (1/1) ... [2024-10-13 10:36:24,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:36:24,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:36:24,848 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 10:36:24,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 10:36:24,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 10:36:24,898 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 10:36:24,898 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 10:36:24,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 10:36:24,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 10:36:24,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-13 10:36:24,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-13 10:36:24,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 10:36:24,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 10:36:24,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 10:36:24,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-13 10:36:24,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-13 10:36:24,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 10:36:24,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 10:36:24,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 10:36:24,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 10:36:24,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 10:36:24,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-13 10:36:24,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-13 10:36:24,900 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-13 10:36:24,900 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-13 10:36:24,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 10:36:24,990 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 10:36:24,992 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 10:36:25,316 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2024-10-13 10:36:25,316 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 10:36:25,377 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 10:36:25,378 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-13 10:36:25,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:36:25 BoogieIcfgContainer [2024-10-13 10:36:25,378 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 10:36:25,381 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 10:36:25,382 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 10:36:25,385 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 10:36:25,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:36:24" (1/3) ... [2024-10-13 10:36:25,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16a5f769 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:36:25, skipping insertion in model container [2024-10-13 10:36:25,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:36:24" (2/3) ... [2024-10-13 10:36:25,387 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16a5f769 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:36:25, skipping insertion in model container [2024-10-13 10:36:25,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:36:25" (3/3) ... [2024-10-13 10:36:25,388 INFO L112 eAbstractionObserver]: Analyzing ICFG duplets.c [2024-10-13 10:36:25,405 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 10:36:25,405 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2024-10-13 10:36:25,454 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 10:36:25,462 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;@2944ed50, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 10:36:25,463 INFO L334 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2024-10-13 10:36:25,469 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 79 states have internal predecessors, (88), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 10:36:25,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-13 10:36:25,476 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:36:25,477 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:36:25,477 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-13 10:36:25,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:36:25,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1260349564, now seen corresponding path program 1 times [2024-10-13 10:36:25,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:36:25,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871929797] [2024-10-13 10:36:25,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:36:25,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:36:25,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:25,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:36:25,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:25,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:36:25,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:25,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 10:36:25,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:25,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 10:36:25,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:25,681 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-13 10:36:25,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:36:25,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871929797] [2024-10-13 10:36:25,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871929797] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:36:25,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:36:25,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:36:25,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352363311] [2024-10-13 10:36:25,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:36:25,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 10:36:25,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:36:25,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 10:36:25,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 10:36:25,738 INFO L87 Difference]: Start difference. First operand has 91 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 79 states have internal predecessors, (88), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:36:25,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:36:25,788 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2024-10-13 10:36:25,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 10:36:25,791 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 24 [2024-10-13 10:36:25,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:36:25,801 INFO L225 Difference]: With dead ends: 91 [2024-10-13 10:36:25,801 INFO L226 Difference]: Without dead ends: 90 [2024-10-13 10:36:25,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 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-10-13 10:36:25,809 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:36:25,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:36:25,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-13 10:36:25,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-13 10:36:25,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 78 states have internal predecessors, (83), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 10:36:25,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2024-10-13 10:36:25,854 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 101 transitions. Word has length 24 [2024-10-13 10:36:25,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:36:25,854 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 101 transitions. [2024-10-13 10:36:25,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:36:25,855 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2024-10-13 10:36:25,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-13 10:36:25,856 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:36:25,856 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:36:25,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 10:36:25,856 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-13 10:36:25,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:36:25,857 INFO L85 PathProgramCache]: Analyzing trace with hash 12007744, now seen corresponding path program 1 times [2024-10-13 10:36:25,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:36:25,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273209033] [2024-10-13 10:36:25,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:36:25,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:36:25,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:26,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:36:26,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:26,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:36:26,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:26,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 10:36:26,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:26,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 10:36:26,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:26,078 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-13 10:36:26,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:36:26,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273209033] [2024-10-13 10:36:26,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273209033] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:36:26,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:36:26,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:36:26,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061842985] [2024-10-13 10:36:26,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:36:26,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:36:26,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:36:26,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:36:26,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:36:26,083 INFO L87 Difference]: Start difference. First operand 90 states and 101 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:36:26,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:36:26,196 INFO L93 Difference]: Finished difference Result 88 states and 99 transitions. [2024-10-13 10:36:26,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:36:26,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 24 [2024-10-13 10:36:26,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:36:26,198 INFO L225 Difference]: With dead ends: 88 [2024-10-13 10:36:26,198 INFO L226 Difference]: Without dead ends: 88 [2024-10-13 10:36:26,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:36:26,200 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 1 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:36:26,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 141 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:36:26,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-13 10:36:26,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-13 10:36:26,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 42 states have (on average 1.9285714285714286) internal successors, (81), 76 states have internal predecessors, (81), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 10:36:26,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2024-10-13 10:36:26,214 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 24 [2024-10-13 10:36:26,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:36:26,215 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2024-10-13 10:36:26,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:36:26,216 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2024-10-13 10:36:26,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-13 10:36:26,217 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:36:26,218 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:36:26,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 10:36:26,218 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-13 10:36:26,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:36:26,219 INFO L85 PathProgramCache]: Analyzing trace with hash 12007745, now seen corresponding path program 1 times [2024-10-13 10:36:26,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:36:26,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578642074] [2024-10-13 10:36:26,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:36:26,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:36:26,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:26,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:36:26,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:26,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:36:26,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:26,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 10:36:26,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:26,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 10:36:26,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:26,653 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 10:36:26,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:36:26,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578642074] [2024-10-13 10:36:26,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578642074] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:36:26,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877134773] [2024-10-13 10:36:26,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:36:26,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:36:26,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:36:26,659 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:36:26,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 10:36:26,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:26,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-13 10:36:26,751 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:36:26,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-13 10:36:27,252 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 10:36:27,252 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:36:27,637 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 10:36:27,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877134773] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:36:27,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:36:27,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 6] total 16 [2024-10-13 10:36:27,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143492511] [2024-10-13 10:36:27,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:36:27,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-13 10:36:27,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:36:27,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-13 10:36:27,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2024-10-13 10:36:27,643 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand has 17 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 14 states have internal predecessors, (24), 7 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (11), 5 states have call predecessors, (11), 7 states have call successors, (11) [2024-10-13 10:36:31,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 10:36:32,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:36:32,146 INFO L93 Difference]: Finished difference Result 123 states and 135 transitions. [2024-10-13 10:36:32,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 10:36:32,147 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 14 states have internal predecessors, (24), 7 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (11), 5 states have call predecessors, (11), 7 states have call successors, (11) Word has length 24 [2024-10-13 10:36:32,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:36:32,148 INFO L225 Difference]: With dead ends: 123 [2024-10-13 10:36:32,148 INFO L226 Difference]: Without dead ends: 123 [2024-10-13 10:36:32,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2024-10-13 10:36:32,149 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 285 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 38 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:36:32,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 399 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 366 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2024-10-13 10:36:32,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-13 10:36:32,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 91. [2024-10-13 10:36:32,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 45 states have (on average 1.8444444444444446) internal successors, (83), 78 states have internal predecessors, (83), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 10:36:32,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2024-10-13 10:36:32,159 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 24 [2024-10-13 10:36:32,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:36:32,159 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2024-10-13 10:36:32,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 14 states have internal predecessors, (24), 7 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (11), 5 states have call predecessors, (11), 7 states have call successors, (11) [2024-10-13 10:36:32,160 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2024-10-13 10:36:32,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-13 10:36:32,160 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:36:32,161 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:36:32,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 10:36:32,364 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-10-13 10:36:32,365 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-13 10:36:32,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:36:32,366 INFO L85 PathProgramCache]: Analyzing trace with hash 372240057, now seen corresponding path program 1 times [2024-10-13 10:36:32,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:36:32,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712100134] [2024-10-13 10:36:32,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:36:32,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:36:32,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:32,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:36:32,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:32,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:36:32,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:32,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 10:36:32,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:32,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 10:36:32,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:32,749 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-13 10:36:32,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:36:32,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712100134] [2024-10-13 10:36:32,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712100134] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:36:32,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381497327] [2024-10-13 10:36:32,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:36:32,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:36:32,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:36:32,757 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:36:32,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 10:36:32,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:32,825 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-13 10:36:32,827 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:36:32,856 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-10-13 10:36:33,473 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:36:33,474 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:36:33,732 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 10:36:33,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381497327] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:36:33,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:36:33,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 6] total 18 [2024-10-13 10:36:33,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471380732] [2024-10-13 10:36:33,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:36:33,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-13 10:36:33,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:36:33,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-13 10:36:33,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2024-10-13 10:36:33,736 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand has 19 states, 14 states have (on average 2.142857142857143) internal successors, (30), 16 states have internal predecessors, (30), 8 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2024-10-13 10:36:34,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:36:34,358 INFO L93 Difference]: Finished difference Result 122 states and 134 transitions. [2024-10-13 10:36:34,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 10:36:34,359 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 14 states have (on average 2.142857142857143) internal successors, (30), 16 states have internal predecessors, (30), 8 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) Word has length 25 [2024-10-13 10:36:34,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:36:34,360 INFO L225 Difference]: With dead ends: 122 [2024-10-13 10:36:34,360 INFO L226 Difference]: Without dead ends: 122 [2024-10-13 10:36:34,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2024-10-13 10:36:34,362 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 182 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 10:36:34,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 488 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 10:36:34,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-13 10:36:34,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 90. [2024-10-13 10:36:34,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 45 states have (on average 1.8222222222222222) internal successors, (82), 77 states have internal predecessors, (82), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 10:36:34,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2024-10-13 10:36:34,370 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 25 [2024-10-13 10:36:34,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:36:34,370 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2024-10-13 10:36:34,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 14 states have (on average 2.142857142857143) internal successors, (30), 16 states have internal predecessors, (30), 8 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2024-10-13 10:36:34,370 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2024-10-13 10:36:34,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-13 10:36:34,371 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:36:34,371 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:36:34,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 10:36:34,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-10-13 10:36:34,576 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-13 10:36:34,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:36:34,577 INFO L85 PathProgramCache]: Analyzing trace with hash -197517515, now seen corresponding path program 1 times [2024-10-13 10:36:34,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:36:34,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695614390] [2024-10-13 10:36:34,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:36:34,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:36:34,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:34,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:36:34,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:34,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:36:34,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:34,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 10:36:34,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:34,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 10:36:34,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:34,757 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-13 10:36:34,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:36:34,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695614390] [2024-10-13 10:36:34,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695614390] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:36:34,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:36:34,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:36:34,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075108629] [2024-10-13 10:36:34,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:36:34,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:36:34,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:36:34,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:36:34,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:36:34,759 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:36:34,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:36:34,852 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2024-10-13 10:36:34,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:36:34,852 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2024-10-13 10:36:34,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:36:34,853 INFO L225 Difference]: With dead ends: 88 [2024-10-13 10:36:34,853 INFO L226 Difference]: Without dead ends: 88 [2024-10-13 10:36:34,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:36:34,854 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 14 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:36:34,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 169 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:36:34,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-13 10:36:34,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-13 10:36:34,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 45 states have (on average 1.7777777777777777) internal successors, (80), 75 states have internal predecessors, (80), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 10:36:34,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 98 transitions. [2024-10-13 10:36:34,867 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 98 transitions. Word has length 28 [2024-10-13 10:36:34,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:36:34,868 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 98 transitions. [2024-10-13 10:36:34,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:36:34,869 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2024-10-13 10:36:34,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-13 10:36:34,870 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:36:34,870 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:36:34,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 10:36:34,870 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-13 10:36:34,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:36:34,871 INFO L85 PathProgramCache]: Analyzing trace with hash -197517514, now seen corresponding path program 1 times [2024-10-13 10:36:34,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:36:34,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540638043] [2024-10-13 10:36:34,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:36:34,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:36:34,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:35,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:36:35,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:35,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:36:35,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:35,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 10:36:35,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:35,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 10:36:35,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:35,073 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-13 10:36:35,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:36:35,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540638043] [2024-10-13 10:36:35,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540638043] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:36:35,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:36:35,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:36:35,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832135238] [2024-10-13 10:36:35,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:36:35,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:36:35,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:36:35,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:36:35,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:36:35,076 INFO L87 Difference]: Start difference. First operand 88 states and 98 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:36:35,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:36:35,260 INFO L93 Difference]: Finished difference Result 96 states and 110 transitions. [2024-10-13 10:36:35,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:36:35,260 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2024-10-13 10:36:35,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:36:35,261 INFO L225 Difference]: With dead ends: 96 [2024-10-13 10:36:35,261 INFO L226 Difference]: Without dead ends: 96 [2024-10-13 10:36:35,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:36:35,262 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 74 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:36:35,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 139 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:36:35,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-13 10:36:35,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2024-10-13 10:36:35,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 50 states have (on average 1.76) internal successors, (88), 79 states have internal predecessors, (88), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 10:36:35,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 106 transitions. [2024-10-13 10:36:35,277 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 106 transitions. Word has length 28 [2024-10-13 10:36:35,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:36:35,278 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 106 transitions. [2024-10-13 10:36:35,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:36:35,278 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 106 transitions. [2024-10-13 10:36:35,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-13 10:36:35,279 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:36:35,279 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:36:35,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 10:36:35,279 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-13 10:36:35,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:36:35,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1828075652, now seen corresponding path program 1 times [2024-10-13 10:36:35,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:36:35,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171019829] [2024-10-13 10:36:35,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:36:35,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:36:35,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:35,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:36:35,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:35,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:36:35,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:35,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 10:36:35,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:35,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 10:36:35,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:35,712 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-13 10:36:35,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:36:35,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171019829] [2024-10-13 10:36:35,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171019829] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:36:35,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358559869] [2024-10-13 10:36:35,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:36:35,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:36:35,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:36:35,715 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:36:35,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 10:36:35,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:35,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-13 10:36:35,789 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:36:35,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:36:35,962 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 43 treesize of output 32 [2024-10-13 10:36:35,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:36:35,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:36:35,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 32 [2024-10-13 10:36:36,062 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-13 10:36:36,063 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:36:36,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358559869] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:36:36,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 10:36:36,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 15 [2024-10-13 10:36:36,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344750702] [2024-10-13 10:36:36,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:36:36,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 10:36:36,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:36:36,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 10:36:36,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2024-10-13 10:36:36,065 INFO L87 Difference]: Start difference. First operand 92 states and 106 transitions. Second operand has 9 states, 7 states have (on average 2.142857142857143) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:36:36,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:36:36,247 INFO L93 Difference]: Finished difference Result 106 states and 122 transitions. [2024-10-13 10:36:36,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:36:36,247 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.142857142857143) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2024-10-13 10:36:36,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:36:36,248 INFO L225 Difference]: With dead ends: 106 [2024-10-13 10:36:36,248 INFO L226 Difference]: Without dead ends: 106 [2024-10-13 10:36:36,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2024-10-13 10:36:36,249 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 24 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:36:36,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 355 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:36:36,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-13 10:36:36,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 95. [2024-10-13 10:36:36,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 53 states have (on average 1.7358490566037736) internal successors, (92), 82 states have internal predecessors, (92), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 10:36:36,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 110 transitions. [2024-10-13 10:36:36,255 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 110 transitions. Word has length 29 [2024-10-13 10:36:36,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:36:36,255 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 110 transitions. [2024-10-13 10:36:36,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.142857142857143) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:36:36,255 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 110 transitions. [2024-10-13 10:36:36,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-13 10:36:36,256 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:36:36,256 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:36:36,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 10:36:36,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:36:36,461 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-13 10:36:36,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:36:36,461 INFO L85 PathProgramCache]: Analyzing trace with hash -959630336, now seen corresponding path program 1 times [2024-10-13 10:36:36,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:36:36,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363084302] [2024-10-13 10:36:36,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:36:36,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:36:36,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:36,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:36:36,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:36,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:36:36,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:36,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 10:36:36,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:36,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 10:36:36,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:36,567 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-13 10:36:36,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:36:36,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363084302] [2024-10-13 10:36:36,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363084302] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:36:36,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264087579] [2024-10-13 10:36:36,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:36:36,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:36:36,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:36:36,569 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:36:36,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 10:36:36,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:36,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 10:36:36,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:36:36,711 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-13 10:36:36,712 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:36:36,838 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-13 10:36:36,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264087579] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:36:36,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:36:36,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2024-10-13 10:36:36,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950086629] [2024-10-13 10:36:36,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:36:36,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 10:36:36,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:36:36,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 10:36:36,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-10-13 10:36:36,841 INFO L87 Difference]: Start difference. First operand 95 states and 110 transitions. Second operand has 14 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 14 states have internal predecessors, (29), 8 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2024-10-13 10:36:37,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:36:37,022 INFO L93 Difference]: Finished difference Result 131 states and 146 transitions. [2024-10-13 10:36:37,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:36:37,023 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 14 states have internal predecessors, (29), 8 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) Word has length 32 [2024-10-13 10:36:37,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:36:37,024 INFO L225 Difference]: With dead ends: 131 [2024-10-13 10:36:37,024 INFO L226 Difference]: Without dead ends: 131 [2024-10-13 10:36:37,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2024-10-13 10:36:37,025 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 180 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:36:37,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 676 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:36:37,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-13 10:36:37,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 95. [2024-10-13 10:36:37,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 53 states have (on average 1.7169811320754718) internal successors, (91), 82 states have internal predecessors, (91), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 10:36:37,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 109 transitions. [2024-10-13 10:36:37,036 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 109 transitions. Word has length 32 [2024-10-13 10:36:37,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:36:37,036 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 109 transitions. [2024-10-13 10:36:37,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 14 states have internal predecessors, (29), 8 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2024-10-13 10:36:37,036 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2024-10-13 10:36:37,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-13 10:36:37,037 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:36:37,037 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:36:37,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-13 10:36:37,237 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-10-13 10:36:37,238 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-13 10:36:37,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:36:37,238 INFO L85 PathProgramCache]: Analyzing trace with hash -140251464, now seen corresponding path program 1 times [2024-10-13 10:36:37,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:36:37,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967796327] [2024-10-13 10:36:37,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:36:37,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:36:37,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:37,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:36:37,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:37,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:36:37,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:37,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 10:36:37,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:37,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 10:36:37,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:37,313 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-13 10:36:37,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:36:37,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967796327] [2024-10-13 10:36:37,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967796327] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:36:37,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92054942] [2024-10-13 10:36:37,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:36:37,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:36:37,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:36:37,315 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:36:37,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-13 10:36:37,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:37,387 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 10:36:37,388 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:36:37,396 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-13 10:36:37,396 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:36:37,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92054942] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:36:37,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 10:36:37,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2024-10-13 10:36:37,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147844000] [2024-10-13 10:36:37,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:36:37,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:36:37,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:36:37,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:36:37,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:36:37,398 INFO L87 Difference]: Start difference. First operand 95 states and 109 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 10:36:37,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:36:37,480 INFO L93 Difference]: Finished difference Result 105 states and 124 transitions. [2024-10-13 10:36:37,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:36:37,481 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2024-10-13 10:36:37,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:36:37,483 INFO L225 Difference]: With dead ends: 105 [2024-10-13 10:36:37,483 INFO L226 Difference]: Without dead ends: 105 [2024-10-13 10:36:37,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:36:37,484 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 6 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:36:37,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 301 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:36:37,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-13 10:36:37,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 98. [2024-10-13 10:36:37,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 56 states have (on average 1.6964285714285714) internal successors, (95), 85 states have internal predecessors, (95), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 10:36:37,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 113 transitions. [2024-10-13 10:36:37,493 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 113 transitions. Word has length 31 [2024-10-13 10:36:37,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:36:37,493 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 113 transitions. [2024-10-13 10:36:37,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 10:36:37,493 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 113 transitions. [2024-10-13 10:36:37,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-13 10:36:37,494 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:36:37,494 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:36:37,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-13 10:36:37,695 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-10-13 10:36:37,696 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-13 10:36:37,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:36:37,696 INFO L85 PathProgramCache]: Analyzing trace with hash -139077796, now seen corresponding path program 1 times [2024-10-13 10:36:37,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:36:37,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033445147] [2024-10-13 10:36:37,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:36:37,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:36:37,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:37,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:36:37,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:37,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:36:37,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:37,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 10:36:37,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:37,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 10:36:37,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:37,762 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-13 10:36:37,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:36:37,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033445147] [2024-10-13 10:36:37,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033445147] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:36:37,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:36:37,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:36:37,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958928738] [2024-10-13 10:36:37,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:36:37,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:36:37,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:36:37,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:36:37,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:36:37,764 INFO L87 Difference]: Start difference. First operand 98 states and 113 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 10:36:37,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:36:37,812 INFO L93 Difference]: Finished difference Result 98 states and 113 transitions. [2024-10-13 10:36:37,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:36:37,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2024-10-13 10:36:37,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:36:37,813 INFO L225 Difference]: With dead ends: 98 [2024-10-13 10:36:37,813 INFO L226 Difference]: Without dead ends: 98 [2024-10-13 10:36:37,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:36:37,814 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 7 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:36:37,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 129 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:36:37,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-13 10:36:37,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2024-10-13 10:36:37,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 56 states have (on average 1.6785714285714286) internal successors, (94), 84 states have internal predecessors, (94), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 10:36:37,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 112 transitions. [2024-10-13 10:36:37,818 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 112 transitions. Word has length 31 [2024-10-13 10:36:37,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:36:37,819 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 112 transitions. [2024-10-13 10:36:37,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 10:36:37,819 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 112 transitions. [2024-10-13 10:36:37,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-13 10:36:37,820 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:36:37,820 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:36:37,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 10:36:37,820 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-13 10:36:37,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:36:37,821 INFO L85 PathProgramCache]: Analyzing trace with hash -139077795, now seen corresponding path program 1 times [2024-10-13 10:36:37,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:36:37,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584553593] [2024-10-13 10:36:37,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:36:37,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:36:37,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:37,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:36:37,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:37,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:36:37,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:37,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 10:36:37,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:37,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 10:36:37,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:37,936 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-13 10:36:37,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:36:37,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584553593] [2024-10-13 10:36:37,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584553593] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:36:37,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:36:37,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:36:37,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793760093] [2024-10-13 10:36:37,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:36:37,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:36:37,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:36:37,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:36:37,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:36:37,940 INFO L87 Difference]: Start difference. First operand 97 states and 112 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 10:36:37,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:36:37,986 INFO L93 Difference]: Finished difference Result 97 states and 112 transitions. [2024-10-13 10:36:37,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:36:37,986 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2024-10-13 10:36:37,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:36:37,987 INFO L225 Difference]: With dead ends: 97 [2024-10-13 10:36:37,987 INFO L226 Difference]: Without dead ends: 97 [2024-10-13 10:36:37,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:36:37,988 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 7 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:36:37,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 130 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:36:37,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-13 10:36:37,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2024-10-13 10:36:37,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 56 states have (on average 1.6607142857142858) internal successors, (93), 83 states have internal predecessors, (93), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 10:36:37,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 111 transitions. [2024-10-13 10:36:37,993 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 111 transitions. Word has length 31 [2024-10-13 10:36:37,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:36:37,993 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 111 transitions. [2024-10-13 10:36:37,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 10:36:37,993 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2024-10-13 10:36:37,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-13 10:36:37,997 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:36:37,997 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:36:37,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 10:36:37,997 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-13 10:36:37,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:36:37,998 INFO L85 PathProgramCache]: Analyzing trace with hash -16444355, now seen corresponding path program 1 times [2024-10-13 10:36:37,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:36:37,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653993533] [2024-10-13 10:36:37,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:36:37,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:36:38,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:38,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:36:38,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:38,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:36:38,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:38,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 10:36:38,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:38,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 10:36:38,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:38,057 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-13 10:36:38,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:36:38,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653993533] [2024-10-13 10:36:38,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653993533] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:36:38,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:36:38,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:36:38,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590823923] [2024-10-13 10:36:38,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:36:38,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:36:38,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:36:38,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:36:38,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:36:38,060 INFO L87 Difference]: Start difference. First operand 96 states and 111 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 10:36:38,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:36:38,108 INFO L93 Difference]: Finished difference Result 96 states and 111 transitions. [2024-10-13 10:36:38,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:36:38,109 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 32 [2024-10-13 10:36:38,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:36:38,110 INFO L225 Difference]: With dead ends: 96 [2024-10-13 10:36:38,110 INFO L226 Difference]: Without dead ends: 96 [2024-10-13 10:36:38,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:36:38,111 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 7 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:36:38,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 126 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:36:38,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-13 10:36:38,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2024-10-13 10:36:38,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 56 states have (on average 1.6428571428571428) internal successors, (92), 82 states have internal predecessors, (92), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 10:36:38,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 110 transitions. [2024-10-13 10:36:38,118 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 110 transitions. Word has length 32 [2024-10-13 10:36:38,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:36:38,118 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 110 transitions. [2024-10-13 10:36:38,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 10:36:38,118 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 110 transitions. [2024-10-13 10:36:38,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-13 10:36:38,119 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:36:38,119 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:36:38,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 10:36:38,120 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-13 10:36:38,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:36:38,120 INFO L85 PathProgramCache]: Analyzing trace with hash -16444354, now seen corresponding path program 1 times [2024-10-13 10:36:38,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:36:38,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086666259] [2024-10-13 10:36:38,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:36:38,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:36:38,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:38,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:36:38,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:38,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:36:38,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:38,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 10:36:38,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:38,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 10:36:38,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:38,202 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-13 10:36:38,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:36:38,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086666259] [2024-10-13 10:36:38,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086666259] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:36:38,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:36:38,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:36:38,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935450516] [2024-10-13 10:36:38,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:36:38,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:36:38,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:36:38,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:36:38,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:36:38,205 INFO L87 Difference]: Start difference. First operand 95 states and 110 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 10:36:38,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:36:38,274 INFO L93 Difference]: Finished difference Result 95 states and 110 transitions. [2024-10-13 10:36:38,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:36:38,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 32 [2024-10-13 10:36:38,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:36:38,275 INFO L225 Difference]: With dead ends: 95 [2024-10-13 10:36:38,275 INFO L226 Difference]: Without dead ends: 95 [2024-10-13 10:36:38,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:36:38,277 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 7 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:36:38,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 127 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:36:38,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-13 10:36:38,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2024-10-13 10:36:38,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 56 states have (on average 1.625) internal successors, (91), 81 states have internal predecessors, (91), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 10:36:38,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 109 transitions. [2024-10-13 10:36:38,281 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 109 transitions. Word has length 32 [2024-10-13 10:36:38,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:36:38,282 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 109 transitions. [2024-10-13 10:36:38,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 10:36:38,282 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 109 transitions. [2024-10-13 10:36:38,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-13 10:36:38,282 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:36:38,282 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:36:38,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 10:36:38,282 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-13 10:36:38,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:36:38,283 INFO L85 PathProgramCache]: Analyzing trace with hash -506150468, now seen corresponding path program 1 times [2024-10-13 10:36:38,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:36:38,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853664751] [2024-10-13 10:36:38,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:36:38,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:36:38,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:38,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:36:38,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:38,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:36:38,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:38,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 10:36:38,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:38,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 10:36:38,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:38,770 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-13 10:36:38,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:36:38,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853664751] [2024-10-13 10:36:38,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853664751] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:36:38,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727447141] [2024-10-13 10:36:38,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:36:38,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:36:38,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:36:38,773 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:36:38,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-13 10:36:38,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:38,895 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-10-13 10:36:38,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:36:38,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-10-13 10:36:39,332 INFO L349 Elim1Store]: treesize reduction 24, result has 27.3 percent of original size [2024-10-13 10:36:39,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 28 [2024-10-13 10:36:39,424 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 37 treesize of output 28 [2024-10-13 10:36:39,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:36:39,442 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 27 treesize of output 20 [2024-10-13 10:36:39,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:36:39,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 10:36:39,472 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 37 treesize of output 28 [2024-10-13 10:36:39,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:36:39,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:36:39,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2024-10-13 10:36:39,496 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 10:36:39,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-13 10:36:39,725 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 43 treesize of output 33 [2024-10-13 10:36:39,935 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 10:36:39,935 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:36:40,308 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:36:40,309 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 159 treesize of output 159 [2024-10-13 10:36:40,331 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:36:40,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 99 [2024-10-13 10:36:41,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727447141] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:36:41,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:36:41,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2024-10-13 10:36:41,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144454377] [2024-10-13 10:36:41,041 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:36:41,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-13 10:36:41,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:36:41,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-13 10:36:41,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=900, Unknown=0, NotChecked=0, Total=992 [2024-10-13 10:36:41,042 INFO L87 Difference]: Start difference. First operand 94 states and 109 transitions. Second operand has 24 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 23 states have internal predecessors, (37), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-13 10:36:42,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:36:42,354 INFO L93 Difference]: Finished difference Result 141 states and 159 transitions. [2024-10-13 10:36:42,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-13 10:36:42,355 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 23 states have internal predecessors, (37), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 33 [2024-10-13 10:36:42,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:36:42,356 INFO L225 Difference]: With dead ends: 141 [2024-10-13 10:36:42,357 INFO L226 Difference]: Without dead ends: 141 [2024-10-13 10:36:42,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=225, Invalid=1667, Unknown=0, NotChecked=0, Total=1892 [2024-10-13 10:36:42,358 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 146 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 10:36:42,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 814 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 10:36:42,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-10-13 10:36:42,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 96. [2024-10-13 10:36:42,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 57 states have (on average 1.5964912280701755) internal successors, (91), 82 states have internal predecessors, (91), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 10:36:42,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 109 transitions. [2024-10-13 10:36:42,362 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 109 transitions. Word has length 33 [2024-10-13 10:36:42,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:36:42,362 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 109 transitions. [2024-10-13 10:36:42,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 23 states have internal predecessors, (37), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-13 10:36:42,363 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 109 transitions. [2024-10-13 10:36:42,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-13 10:36:42,363 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:36:42,363 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:36:42,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-13 10:36:42,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:36:42,564 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-13 10:36:42,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:36:42,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1507816066, now seen corresponding path program 1 times [2024-10-13 10:36:42,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:36:42,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233925487] [2024-10-13 10:36:42,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:36:42,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:36:42,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:42,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:36:42,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:42,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:36:42,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:42,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 10:36:42,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:42,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 10:36:42,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:42,921 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-13 10:36:42,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:36:42,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233925487] [2024-10-13 10:36:42,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233925487] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:36:42,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:36:42,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 10:36:42,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818695929] [2024-10-13 10:36:42,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:36:42,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 10:36:42,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:36:42,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 10:36:42,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-13 10:36:42,923 INFO L87 Difference]: Start difference. First operand 96 states and 109 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:36:43,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:36:43,197 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2024-10-13 10:36:43,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 10:36:43,197 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 35 [2024-10-13 10:36:43,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:36:43,198 INFO L225 Difference]: With dead ends: 98 [2024-10-13 10:36:43,198 INFO L226 Difference]: Without dead ends: 98 [2024-10-13 10:36:43,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-13 10:36:43,199 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 12 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:36:43,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 462 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:36:43,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-13 10:36:43,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2024-10-13 10:36:43,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 57 states have (on average 1.5789473684210527) internal successors, (90), 82 states have internal predecessors, (90), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 10:36:43,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2024-10-13 10:36:43,205 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 35 [2024-10-13 10:36:43,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:36:43,205 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2024-10-13 10:36:43,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:36:43,206 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2024-10-13 10:36:43,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-13 10:36:43,207 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:36:43,207 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:36:43,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 10:36:43,207 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-13 10:36:43,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:36:43,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1080469256, now seen corresponding path program 1 times [2024-10-13 10:36:43,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:36:43,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653704298] [2024-10-13 10:36:43,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:36:43,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:36:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:43,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:36:43,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:43,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:36:43,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:43,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 10:36:43,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:43,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 10:36:43,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:43,284 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-13 10:36:43,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:36:43,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653704298] [2024-10-13 10:36:43,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653704298] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:36:43,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070902584] [2024-10-13 10:36:43,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:36:43,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:36:43,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:36:43,286 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:36:43,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-13 10:36:43,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:43,371 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 10:36:43,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:36:43,393 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-13 10:36:43,393 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:36:43,433 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-13 10:36:43,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070902584] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:36:43,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:36:43,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2024-10-13 10:36:43,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357729060] [2024-10-13 10:36:43,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:36:43,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:36:43,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:36:43,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:36:43,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:36:43,435 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 10:36:43,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:36:43,521 INFO L93 Difference]: Finished difference Result 115 states and 138 transitions. [2024-10-13 10:36:43,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:36:43,522 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 35 [2024-10-13 10:36:43,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:36:43,523 INFO L225 Difference]: With dead ends: 115 [2024-10-13 10:36:43,523 INFO L226 Difference]: Without dead ends: 115 [2024-10-13 10:36:43,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 74 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:36:43,523 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 8 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:36:43,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 353 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:36:43,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-13 10:36:43,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 107. [2024-10-13 10:36:43,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 68 states have (on average 1.588235294117647) internal successors, (108), 93 states have internal predecessors, (108), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 10:36:43,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 126 transitions. [2024-10-13 10:36:43,529 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 126 transitions. Word has length 35 [2024-10-13 10:36:43,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:36:43,530 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 126 transitions. [2024-10-13 10:36:43,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 10:36:43,530 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 126 transitions. [2024-10-13 10:36:43,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-13 10:36:43,531 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:36:43,531 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:36:43,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-13 10:36:43,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:36:43,732 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-13 10:36:43,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:36:43,732 INFO L85 PathProgramCache]: Analyzing trace with hash -193969567, now seen corresponding path program 1 times [2024-10-13 10:36:43,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:36:43,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990386703] [2024-10-13 10:36:43,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:36:43,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:36:43,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:43,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:36:43,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:43,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:36:43,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:43,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 10:36:43,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:43,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 10:36:43,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:43,799 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-13 10:36:43,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:36:43,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990386703] [2024-10-13 10:36:43,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990386703] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:36:43,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:36:43,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 10:36:43,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338536306] [2024-10-13 10:36:43,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:36:43,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:36:43,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:36:43,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:36:43,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:36:43,801 INFO L87 Difference]: Start difference. First operand 107 states and 126 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 10:36:43,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:36:43,875 INFO L93 Difference]: Finished difference Result 160 states and 184 transitions. [2024-10-13 10:36:43,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:36:43,876 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2024-10-13 10:36:43,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:36:43,877 INFO L225 Difference]: With dead ends: 160 [2024-10-13 10:36:43,877 INFO L226 Difference]: Without dead ends: 160 [2024-10-13 10:36:43,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:36:43,879 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 47 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:36:43,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 544 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:36:43,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-10-13 10:36:43,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 113. [2024-10-13 10:36:43,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 72 states have (on average 1.5555555555555556) internal successors, (112), 98 states have internal predecessors, (112), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 10:36:43,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 132 transitions. [2024-10-13 10:36:43,884 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 132 transitions. Word has length 37 [2024-10-13 10:36:43,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:36:43,884 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 132 transitions. [2024-10-13 10:36:43,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 10:36:43,884 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 132 transitions. [2024-10-13 10:36:43,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-13 10:36:43,885 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:36:43,885 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:36:43,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 10:36:43,885 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-13 10:36:43,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:36:43,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1720969682, now seen corresponding path program 1 times [2024-10-13 10:36:43,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:36:43,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815596533] [2024-10-13 10:36:43,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:36:43,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:36:43,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:43,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:36:43,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:43,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:36:43,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:43,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 10:36:43,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:43,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 10:36:43,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:43,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-13 10:36:43,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:43,941 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-13 10:36:43,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:36:43,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815596533] [2024-10-13 10:36:43,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815596533] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:36:43,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:36:43,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:36:43,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134671712] [2024-10-13 10:36:43,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:36:43,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:36:43,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:36:43,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:36:43,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:36:43,943 INFO L87 Difference]: Start difference. First operand 113 states and 132 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-13 10:36:44,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:36:44,028 INFO L93 Difference]: Finished difference Result 109 states and 128 transitions. [2024-10-13 10:36:44,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:36:44,028 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2024-10-13 10:36:44,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:36:44,030 INFO L225 Difference]: With dead ends: 109 [2024-10-13 10:36:44,030 INFO L226 Difference]: Without dead ends: 109 [2024-10-13 10:36:44,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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-10-13 10:36:44,031 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 53 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:36:44,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 108 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:36:44,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-13 10:36:44,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-10-13 10:36:44,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 72 states have (on average 1.5) internal successors, (108), 94 states have internal predecessors, (108), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 10:36:44,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 128 transitions. [2024-10-13 10:36:44,034 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 128 transitions. Word has length 39 [2024-10-13 10:36:44,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:36:44,035 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 128 transitions. [2024-10-13 10:36:44,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-13 10:36:44,035 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 128 transitions. [2024-10-13 10:36:44,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-13 10:36:44,036 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:36:44,036 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:36:44,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 10:36:44,036 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-13 10:36:44,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:36:44,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1720969681, now seen corresponding path program 1 times [2024-10-13 10:36:44,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:36:44,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919738551] [2024-10-13 10:36:44,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:36:44,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:36:44,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:44,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:36:44,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:44,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:36:44,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:44,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 10:36:44,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:44,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 10:36:44,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:44,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-13 10:36:44,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:44,108 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-13 10:36:44,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:36:44,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919738551] [2024-10-13 10:36:44,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919738551] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:36:44,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:36:44,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:36:44,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887345864] [2024-10-13 10:36:44,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:36:44,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:36:44,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:36:44,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:36:44,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:36:44,110 INFO L87 Difference]: Start difference. First operand 109 states and 128 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-13 10:36:44,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:36:44,192 INFO L93 Difference]: Finished difference Result 105 states and 124 transitions. [2024-10-13 10:36:44,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:36:44,192 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2024-10-13 10:36:44,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:36:44,193 INFO L225 Difference]: With dead ends: 105 [2024-10-13 10:36:44,193 INFO L226 Difference]: Without dead ends: 105 [2024-10-13 10:36:44,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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-10-13 10:36:44,194 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 38 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:36:44,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 129 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:36:44,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-13 10:36:44,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-10-13 10:36:44,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 90 states have internal predecessors, (104), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 10:36:44,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 124 transitions. [2024-10-13 10:36:44,200 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 124 transitions. Word has length 39 [2024-10-13 10:36:44,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:36:44,201 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 124 transitions. [2024-10-13 10:36:44,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-13 10:36:44,201 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 124 transitions. [2024-10-13 10:36:44,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-13 10:36:44,202 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:36:44,202 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:36:44,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 10:36:44,202 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-13 10:36:44,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:36:44,203 INFO L85 PathProgramCache]: Analyzing trace with hash -124404542, now seen corresponding path program 1 times [2024-10-13 10:36:44,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:36:44,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047446055] [2024-10-13 10:36:44,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:36:44,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:36:44,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:44,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:36:44,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:44,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:36:44,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:44,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 10:36:44,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:44,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 10:36:44,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:44,267 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-13 10:36:44,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:36:44,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047446055] [2024-10-13 10:36:44,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047446055] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:36:44,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963797998] [2024-10-13 10:36:44,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:36:44,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:36:44,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:36:44,270 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:36:44,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-13 10:36:44,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:44,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 10:36:44,378 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:36:44,396 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-13 10:36:44,397 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:36:44,435 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-13 10:36:44,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963797998] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:36:44,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:36:44,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2024-10-13 10:36:44,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407735203] [2024-10-13 10:36:44,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:36:44,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:36:44,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:36:44,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:36:44,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:36:44,438 INFO L87 Difference]: Start difference. First operand 105 states and 124 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 10:36:44,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:36:44,508 INFO L93 Difference]: Finished difference Result 105 states and 122 transitions. [2024-10-13 10:36:44,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:36:44,509 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 39 [2024-10-13 10:36:44,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:36:44,509 INFO L225 Difference]: With dead ends: 105 [2024-10-13 10:36:44,510 INFO L226 Difference]: Without dead ends: 105 [2024-10-13 10:36:44,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 83 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:36:44,510 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 7 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:36:44,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 248 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:36:44,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-13 10:36:44,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-10-13 10:36:44,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 72 states have (on average 1.4166666666666667) internal successors, (102), 90 states have internal predecessors, (102), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 10:36:44,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 122 transitions. [2024-10-13 10:36:44,519 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 122 transitions. Word has length 39 [2024-10-13 10:36:44,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:36:44,520 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 122 transitions. [2024-10-13 10:36:44,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 10:36:44,521 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 122 transitions. [2024-10-13 10:36:44,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-13 10:36:44,521 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:36:44,521 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:36:44,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-13 10:36:44,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:36:44,722 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-13 10:36:44,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:36:44,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1582277432, now seen corresponding path program 2 times [2024-10-13 10:36:44,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:36:44,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357081530] [2024-10-13 10:36:44,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:36:44,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:36:44,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:44,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:36:44,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:44,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:36:44,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:44,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 10:36:44,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:44,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 10:36:44,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:44,883 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-13 10:36:44,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:36:44,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357081530] [2024-10-13 10:36:44,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357081530] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:36:44,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427072174] [2024-10-13 10:36:44,883 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:36:44,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:36:44,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:36:44,886 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:36:44,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-13 10:36:44,969 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 10:36:44,970 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:36:44,971 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 10:36:44,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:36:45,109 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-13 10:36:45,110 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:36:45,179 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 30 treesize of output 26 [2024-10-13 10:36:45,248 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-13 10:36:45,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427072174] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:36:45,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:36:45,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2024-10-13 10:36:45,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143423509] [2024-10-13 10:36:45,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:36:45,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-13 10:36:45,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:36:45,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-13 10:36:45,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2024-10-13 10:36:45,250 INFO L87 Difference]: Start difference. First operand 105 states and 122 transitions. Second operand has 18 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 18 states have internal predecessors, (56), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-13 10:36:45,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:36:45,611 INFO L93 Difference]: Finished difference Result 125 states and 148 transitions. [2024-10-13 10:36:45,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-13 10:36:45,612 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 18 states have internal predecessors, (56), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 39 [2024-10-13 10:36:45,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:36:45,612 INFO L225 Difference]: With dead ends: 125 [2024-10-13 10:36:45,613 INFO L226 Difference]: Without dead ends: 125 [2024-10-13 10:36:45,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=299, Invalid=757, Unknown=0, NotChecked=0, Total=1056 [2024-10-13 10:36:45,614 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 91 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:36:45,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 297 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:36:45,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-10-13 10:36:45,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 104. [2024-10-13 10:36:45,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 72 states have (on average 1.3888888888888888) internal successors, (100), 89 states have internal predecessors, (100), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 10:36:45,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 120 transitions. [2024-10-13 10:36:45,618 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 120 transitions. Word has length 39 [2024-10-13 10:36:45,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:36:45,618 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 120 transitions. [2024-10-13 10:36:45,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 18 states have internal predecessors, (56), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-13 10:36:45,619 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 120 transitions. [2024-10-13 10:36:45,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-13 10:36:45,620 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:36:45,620 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:36:45,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-13 10:36:45,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:36:45,821 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-13 10:36:45,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:36:45,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1805960122, now seen corresponding path program 1 times [2024-10-13 10:36:45,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:36:45,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678138427] [2024-10-13 10:36:45,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:36:45,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:36:45,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:45,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:36:45,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:45,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:36:45,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:45,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 10:36:45,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:45,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 10:36:45,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:45,989 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-13 10:36:45,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:36:45,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678138427] [2024-10-13 10:36:45,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678138427] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:36:45,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439320422] [2024-10-13 10:36:45,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:36:45,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:36:45,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:36:45,991 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:36:45,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-13 10:36:46,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:46,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 10:36:46,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:36:46,261 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-13 10:36:46,262 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:36:46,340 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 30 treesize of output 26 [2024-10-13 10:36:46,449 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-13 10:36:46,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439320422] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:36:46,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:36:46,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2024-10-13 10:36:46,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781896345] [2024-10-13 10:36:46,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:36:46,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-13 10:36:46,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:36:46,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-13 10:36:46,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2024-10-13 10:36:46,453 INFO L87 Difference]: Start difference. First operand 104 states and 120 transitions. Second operand has 23 states, 22 states have (on average 2.772727272727273) internal successors, (61), 23 states have internal predecessors, (61), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-13 10:36:47,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:36:47,068 INFO L93 Difference]: Finished difference Result 115 states and 131 transitions. [2024-10-13 10:36:47,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-13 10:36:47,069 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.772727272727273) internal successors, (61), 23 states have internal predecessors, (61), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 40 [2024-10-13 10:36:47,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:36:47,070 INFO L225 Difference]: With dead ends: 115 [2024-10-13 10:36:47,070 INFO L226 Difference]: Without dead ends: 115 [2024-10-13 10:36:47,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=383, Invalid=1257, Unknown=0, NotChecked=0, Total=1640 [2024-10-13 10:36:47,071 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 209 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:36:47,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 518 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:36:47,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-13 10:36:47,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 104. [2024-10-13 10:36:47,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 72 states have (on average 1.375) internal successors, (99), 89 states have internal predecessors, (99), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 10:36:47,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 119 transitions. [2024-10-13 10:36:47,077 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 119 transitions. Word has length 40 [2024-10-13 10:36:47,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:36:47,078 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 119 transitions. [2024-10-13 10:36:47,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.772727272727273) internal successors, (61), 23 states have internal predecessors, (61), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-13 10:36:47,078 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 119 transitions. [2024-10-13 10:36:47,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-13 10:36:47,079 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:36:47,079 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2024-10-13 10:36:47,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-13 10:36:47,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-13 10:36:47,280 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-13 10:36:47,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:36:47,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1321067904, now seen corresponding path program 2 times [2024-10-13 10:36:47,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:36:47,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784190547] [2024-10-13 10:36:47,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:36:47,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:36:47,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:48,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:36:48,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:48,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:36:48,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:48,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 10:36:48,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:48,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 10:36:48,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:48,088 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-13 10:36:48,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:36:48,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784190547] [2024-10-13 10:36:48,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784190547] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:36:48,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138112776] [2024-10-13 10:36:48,089 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:36:48,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:36:48,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:36:48,091 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:36:48,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-13 10:36:48,165 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 10:36:48,166 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:36:48,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-13 10:36:48,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:36:48,415 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 11 [2024-10-13 10:36:48,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:36:48,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2024-10-13 10:36:52,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 10:36:52,763 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:36:52,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 46 [2024-10-13 10:36:53,025 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-13 10:36:53,025 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:36:53,304 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:36:53,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 515 treesize of output 447 [2024-10-13 10:36:55,543 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-13 10:36:55,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138112776] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:36:55,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:36:55,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 16] total 38 [2024-10-13 10:36:55,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118468856] [2024-10-13 10:36:55,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:36:55,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-10-13 10:36:55,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:36:55,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-13 10:36:55,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1271, Unknown=1, NotChecked=0, Total=1406 [2024-10-13 10:36:55,545 INFO L87 Difference]: Start difference. First operand 104 states and 119 transitions. Second operand has 38 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 34 states have internal predecessors, (58), 9 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-10-13 10:36:56,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:36:56,825 INFO L93 Difference]: Finished difference Result 140 states and 163 transitions. [2024-10-13 10:36:56,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-13 10:36:56,826 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 34 states have internal predecessors, (58), 9 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) Word has length 42 [2024-10-13 10:36:56,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:36:56,827 INFO L225 Difference]: With dead ends: 140 [2024-10-13 10:36:56,827 INFO L226 Difference]: Without dead ends: 138 [2024-10-13 10:36:56,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=282, Invalid=2069, Unknown=1, NotChecked=0, Total=2352 [2024-10-13 10:36:56,828 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 82 mSDsluCounter, 1235 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 10:36:56,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 1294 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 813 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 10:36:56,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-10-13 10:36:56,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 107. [2024-10-13 10:36:56,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 75 states have (on average 1.3466666666666667) internal successors, (101), 92 states have internal predecessors, (101), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 10:36:56,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 121 transitions. [2024-10-13 10:36:56,836 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 121 transitions. Word has length 42 [2024-10-13 10:36:56,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:36:56,837 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 121 transitions. [2024-10-13 10:36:56,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 31 states have (on average 1.8709677419354838) internal successors, (58), 34 states have internal predecessors, (58), 9 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-10-13 10:36:56,837 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 121 transitions. [2024-10-13 10:36:56,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-13 10:36:56,837 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:36:56,837 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2024-10-13 10:36:56,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-13 10:36:57,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-10-13 10:36:57,038 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-13 10:36:57,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:36:57,038 INFO L85 PathProgramCache]: Analyzing trace with hash -420872010, now seen corresponding path program 1 times [2024-10-13 10:36:57,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:36:57,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723642384] [2024-10-13 10:36:57,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:36:57,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:36:57,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:57,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:36:57,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:57,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:36:57,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:57,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 10:36:57,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:57,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 10:36:57,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:57,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-13 10:36:57,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:57,146 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-13 10:36:57,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:36:57,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723642384] [2024-10-13 10:36:57,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723642384] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:36:57,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:36:57,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:36:57,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864819462] [2024-10-13 10:36:57,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:36:57,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:36:57,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:36:57,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:36:57,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:36:57,152 INFO L87 Difference]: Start difference. First operand 107 states and 121 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-13 10:36:57,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:36:57,221 INFO L93 Difference]: Finished difference Result 132 states and 151 transitions. [2024-10-13 10:36:57,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:36:57,221 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 44 [2024-10-13 10:36:57,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:36:57,222 INFO L225 Difference]: With dead ends: 132 [2024-10-13 10:36:57,222 INFO L226 Difference]: Without dead ends: 132 [2024-10-13 10:36:57,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:36:57,223 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 20 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:36:57,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 247 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:36:57,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-13 10:36:57,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 113. [2024-10-13 10:36:57,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 80 states have (on average 1.325) internal successors, (106), 97 states have internal predecessors, (106), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 10:36:57,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 128 transitions. [2024-10-13 10:36:57,230 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 128 transitions. Word has length 44 [2024-10-13 10:36:57,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:36:57,231 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 128 transitions. [2024-10-13 10:36:57,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-13 10:36:57,231 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 128 transitions. [2024-10-13 10:36:57,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-13 10:36:57,231 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:36:57,231 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2024-10-13 10:36:57,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-13 10:36:57,232 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-13 10:36:57,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:36:57,232 INFO L85 PathProgramCache]: Analyzing trace with hash -324941009, now seen corresponding path program 1 times [2024-10-13 10:36:57,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:36:57,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518076096] [2024-10-13 10:36:57,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:36:57,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:36:57,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:57,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:36:57,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:57,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:36:57,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:57,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 10:36:57,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:57,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 10:36:57,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:57,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-13 10:36:57,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:57,460 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-13 10:36:57,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:36:57,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518076096] [2024-10-13 10:36:57,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518076096] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:36:57,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:36:57,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 10:36:57,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798483161] [2024-10-13 10:36:57,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:36:57,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 10:36:57,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:36:57,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 10:36:57,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-13 10:36:57,463 INFO L87 Difference]: Start difference. First operand 113 states and 128 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-13 10:36:57,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:36:57,677 INFO L93 Difference]: Finished difference Result 136 states and 154 transitions. [2024-10-13 10:36:57,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:36:57,678 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 45 [2024-10-13 10:36:57,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:36:57,679 INFO L225 Difference]: With dead ends: 136 [2024-10-13 10:36:57,679 INFO L226 Difference]: Without dead ends: 136 [2024-10-13 10:36:57,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-10-13 10:36:57,681 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 31 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:36:57,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 531 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:36:57,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-13 10:36:57,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 119. [2024-10-13 10:36:57,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 102 states have internal predecessors, (110), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 10:36:57,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 134 transitions. [2024-10-13 10:36:57,690 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 134 transitions. Word has length 45 [2024-10-13 10:36:57,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:36:57,690 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 134 transitions. [2024-10-13 10:36:57,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-13 10:36:57,690 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 134 transitions. [2024-10-13 10:36:57,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-13 10:36:57,691 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:36:57,691 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:36:57,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-13 10:36:57,691 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-13 10:36:57,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:36:57,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1074041094, now seen corresponding path program 2 times [2024-10-13 10:36:57,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:36:57,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803275356] [2024-10-13 10:36:57,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:36:57,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:36:57,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:57,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:36:57,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:57,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:36:57,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:57,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 10:36:57,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:57,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 10:36:57,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:57,790 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-13 10:36:57,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:36:57,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803275356] [2024-10-13 10:36:57,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803275356] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:36:57,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644895785] [2024-10-13 10:36:57,791 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:36:57,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:36:57,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:36:57,793 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:36:57,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-13 10:36:57,885 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 10:36:57,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:36:57,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 10:36:57,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:36:57,916 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-13 10:36:57,916 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:36:57,984 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-13 10:36:57,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644895785] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:36:57,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:36:57,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 9 [2024-10-13 10:36:57,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482965746] [2024-10-13 10:36:57,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:36:57,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 10:36:57,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:36:57,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 10:36:57,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-13 10:36:57,986 INFO L87 Difference]: Start difference. First operand 119 states and 134 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 10:36:58,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:36:58,110 INFO L93 Difference]: Finished difference Result 151 states and 176 transitions. [2024-10-13 10:36:58,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:36:58,111 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2024-10-13 10:36:58,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:36:58,112 INFO L225 Difference]: With dead ends: 151 [2024-10-13 10:36:58,112 INFO L226 Difference]: Without dead ends: 151 [2024-10-13 10:36:58,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 90 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-13 10:36:58,113 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 17 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:36:58,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 439 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:36:58,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-10-13 10:36:58,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 137. [2024-10-13 10:36:58,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 102 states have (on average 1.3235294117647058) internal successors, (135), 120 states have internal predecessors, (135), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 10:36:58,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 159 transitions. [2024-10-13 10:36:58,121 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 159 transitions. Word has length 44 [2024-10-13 10:36:58,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:36:58,122 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 159 transitions. [2024-10-13 10:36:58,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-13 10:36:58,122 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 159 transitions. [2024-10-13 10:36:58,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-13 10:36:58,122 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:36:58,122 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2024-10-13 10:36:58,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-10-13 10:36:58,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-10-13 10:36:58,323 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-13 10:36:58,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:36:58,324 INFO L85 PathProgramCache]: Analyzing trace with hash 544593299, now seen corresponding path program 1 times [2024-10-13 10:36:58,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:36:58,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033005312] [2024-10-13 10:36:58,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:36:58,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:36:58,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:58,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:36:58,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:58,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:36:58,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:58,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 10:36:58,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:58,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 10:36:58,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:58,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-13 10:36:58,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:58,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 10:36:58,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:58,374 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-13 10:36:58,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:36:58,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033005312] [2024-10-13 10:36:58,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033005312] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:36:58,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:36:58,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:36:58,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246223154] [2024-10-13 10:36:58,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:36:58,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:36:58,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:36:58,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:36:58,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:36:58,376 INFO L87 Difference]: Start difference. First operand 137 states and 159 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-13 10:36:58,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:36:58,439 INFO L93 Difference]: Finished difference Result 133 states and 155 transitions. [2024-10-13 10:36:58,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:36:58,439 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2024-10-13 10:36:58,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:36:58,440 INFO L225 Difference]: With dead ends: 133 [2024-10-13 10:36:58,440 INFO L226 Difference]: Without dead ends: 133 [2024-10-13 10:36:58,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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-10-13 10:36:58,441 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 40 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:36:58,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 99 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:36:58,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-13 10:36:58,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-10-13 10:36:58,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 102 states have (on average 1.2843137254901962) internal successors, (131), 116 states have internal predecessors, (131), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 10:36:58,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 155 transitions. [2024-10-13 10:36:58,445 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 155 transitions. Word has length 48 [2024-10-13 10:36:58,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:36:58,445 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 155 transitions. [2024-10-13 10:36:58,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-13 10:36:58,445 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 155 transitions. [2024-10-13 10:36:58,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-13 10:36:58,445 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:36:58,445 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2024-10-13 10:36:58,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-13 10:36:58,446 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-13 10:36:58,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:36:58,446 INFO L85 PathProgramCache]: Analyzing trace with hash 544593300, now seen corresponding path program 1 times [2024-10-13 10:36:58,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:36:58,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566852464] [2024-10-13 10:36:58,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:36:58,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:36:58,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:58,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:36:58,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:58,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:36:58,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:58,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 10:36:58,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:58,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 10:36:58,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:58,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-13 10:36:58,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:58,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 10:36:58,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:58,531 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-13 10:36:58,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:36:58,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566852464] [2024-10-13 10:36:58,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566852464] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:36:58,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:36:58,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:36:58,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465798784] [2024-10-13 10:36:58,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:36:58,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:36:58,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:36:58,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:36:58,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:36:58,533 INFO L87 Difference]: Start difference. First operand 133 states and 155 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-13 10:36:58,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:36:58,613 INFO L93 Difference]: Finished difference Result 129 states and 151 transitions. [2024-10-13 10:36:58,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:36:58,613 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2024-10-13 10:36:58,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:36:58,614 INFO L225 Difference]: With dead ends: 129 [2024-10-13 10:36:58,614 INFO L226 Difference]: Without dead ends: 129 [2024-10-13 10:36:58,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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-10-13 10:36:58,615 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 31 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:36:58,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 115 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:36:58,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-10-13 10:36:58,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2024-10-13 10:36:58,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 102 states have (on average 1.2450980392156863) internal successors, (127), 112 states have internal predecessors, (127), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 10:36:58,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 151 transitions. [2024-10-13 10:36:58,620 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 151 transitions. Word has length 48 [2024-10-13 10:36:58,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:36:58,620 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 151 transitions. [2024-10-13 10:36:58,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-13 10:36:58,621 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 151 transitions. [2024-10-13 10:36:58,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-13 10:36:58,621 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:36:58,621 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:36:58,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-13 10:36:58,621 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-13 10:36:58,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:36:58,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1693143878, now seen corresponding path program 3 times [2024-10-13 10:36:58,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:36:58,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724737200] [2024-10-13 10:36:58,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:36:58,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:36:58,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:58,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:36:58,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:58,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:36:58,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:58,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 10:36:58,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:58,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 10:36:58,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:36:58,815 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-13 10:36:58,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:36:58,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724737200] [2024-10-13 10:36:58,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724737200] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:36:58,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136783642] [2024-10-13 10:36:58,816 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 10:36:58,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:36:58,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:36:58,818 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:36:58,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-13 10:36:58,903 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-13 10:36:58,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:36:58,905 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 10:36:58,906 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:36:59,021 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 27 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-13 10:36:59,021 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:36:59,258 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 26 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-13 10:36:59,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136783642] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:36:59,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:36:59,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 24 [2024-10-13 10:36:59,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912204579] [2024-10-13 10:36:59,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:36:59,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-13 10:36:59,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:36:59,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-13 10:36:59,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=495, Unknown=0, NotChecked=0, Total=600 [2024-10-13 10:36:59,260 INFO L87 Difference]: Start difference. First operand 129 states and 151 transitions. Second operand has 25 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 25 states have internal predecessors, (64), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-13 10:37:00,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:37:00,039 INFO L93 Difference]: Finished difference Result 155 states and 182 transitions. [2024-10-13 10:37:00,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-13 10:37:00,040 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 25 states have internal predecessors, (64), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 48 [2024-10-13 10:37:00,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:37:00,041 INFO L225 Difference]: With dead ends: 155 [2024-10-13 10:37:00,041 INFO L226 Difference]: Without dead ends: 155 [2024-10-13 10:37:00,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 627 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=548, Invalid=2314, Unknown=0, NotChecked=0, Total=2862 [2024-10-13 10:37:00,043 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 121 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:37:00,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 614 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:37:00,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-10-13 10:37:00,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 128. [2024-10-13 10:37:00,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 102 states have (on average 1.2254901960784315) internal successors, (125), 111 states have internal predecessors, (125), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 10:37:00,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 149 transitions. [2024-10-13 10:37:00,061 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 149 transitions. Word has length 48 [2024-10-13 10:37:00,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:37:00,063 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 149 transitions. [2024-10-13 10:37:00,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 25 states have internal predecessors, (64), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-13 10:37:00,064 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 149 transitions. [2024-10-13 10:37:00,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-13 10:37:00,064 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:37:00,064 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 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] [2024-10-13 10:37:00,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-13 10:37:00,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-10-13 10:37:00,265 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-13 10:37:00,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:37:00,266 INFO L85 PathProgramCache]: Analyzing trace with hash -500401876, now seen corresponding path program 1 times [2024-10-13 10:37:00,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:37:00,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331062081] [2024-10-13 10:37:00,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:00,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:37:00,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:00,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:37:00,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:00,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:37:00,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:00,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 10:37:00,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:00,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 10:37:00,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:00,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-13 10:37:00,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:00,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 10:37:00,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:00,421 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-13 10:37:00,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:37:00,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331062081] [2024-10-13 10:37:00,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331062081] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:37:00,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:37:00,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 10:37:00,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645762645] [2024-10-13 10:37:00,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:37:00,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:37:00,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:37:00,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:37:00,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:37:00,424 INFO L87 Difference]: Start difference. First operand 128 states and 149 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-13 10:37:00,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:37:00,528 INFO L93 Difference]: Finished difference Result 143 states and 166 transitions. [2024-10-13 10:37:00,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:37:00,529 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 53 [2024-10-13 10:37:00,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:37:00,529 INFO L225 Difference]: With dead ends: 143 [2024-10-13 10:37:00,529 INFO L226 Difference]: Without dead ends: 143 [2024-10-13 10:37:00,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:37:00,530 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 12 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:37:00,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 297 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:37:00,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-10-13 10:37:00,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 131. [2024-10-13 10:37:00,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 105 states have (on average 1.2190476190476192) internal successors, (128), 113 states have internal predecessors, (128), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 10:37:00,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 152 transitions. [2024-10-13 10:37:00,533 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 152 transitions. Word has length 53 [2024-10-13 10:37:00,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:37:00,534 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 152 transitions. [2024-10-13 10:37:00,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-13 10:37:00,534 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 152 transitions. [2024-10-13 10:37:00,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-13 10:37:00,534 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:37:00,534 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:37:00,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-13 10:37:00,535 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-13 10:37:00,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:37:00,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1505583544, now seen corresponding path program 1 times [2024-10-13 10:37:00,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:37:00,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380766523] [2024-10-13 10:37:00,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:00,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:37:00,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:00,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:37:00,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:00,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:37:00,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:00,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 10:37:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:00,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 10:37:00,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:00,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-13 10:37:00,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:00,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 10:37:00,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:00,685 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-13 10:37:00,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:37:00,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380766523] [2024-10-13 10:37:00,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380766523] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:37:00,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:37:00,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 10:37:00,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618240222] [2024-10-13 10:37:00,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:37:00,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:37:00,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:37:00,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:37:00,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:37:00,687 INFO L87 Difference]: Start difference. First operand 131 states and 152 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-13 10:37:00,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:37:00,803 INFO L93 Difference]: Finished difference Result 156 states and 182 transitions. [2024-10-13 10:37:00,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 10:37:00,804 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 54 [2024-10-13 10:37:00,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:37:00,804 INFO L225 Difference]: With dead ends: 156 [2024-10-13 10:37:00,804 INFO L226 Difference]: Without dead ends: 156 [2024-10-13 10:37:00,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:37:00,805 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 21 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:37:00,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 440 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:37:00,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-10-13 10:37:00,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 144. [2024-10-13 10:37:00,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 115 states have (on average 1.2173913043478262) internal successors, (140), 123 states have internal predecessors, (140), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 10:37:00,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 168 transitions. [2024-10-13 10:37:00,809 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 168 transitions. Word has length 54 [2024-10-13 10:37:00,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:37:00,809 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 168 transitions. [2024-10-13 10:37:00,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-13 10:37:00,809 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 168 transitions. [2024-10-13 10:37:00,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-13 10:37:00,810 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:37:00,810 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:37:00,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-13 10:37:00,810 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-13 10:37:00,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:37:00,810 INFO L85 PathProgramCache]: Analyzing trace with hash 689402626, now seen corresponding path program 3 times [2024-10-13 10:37:00,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:37:00,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685460663] [2024-10-13 10:37:00,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:00,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:37:00,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:05,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:37:05,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:05,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:37:05,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:05,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 10:37:05,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:05,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 10:37:05,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:05,052 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 11 proven. 20 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-13 10:37:05,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:37:05,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685460663] [2024-10-13 10:37:05,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685460663] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:37:05,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792571511] [2024-10-13 10:37:05,052 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 10:37:05,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:37:05,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:37:05,054 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:37:05,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-13 10:37:05,175 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-10-13 10:37:05,175 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:37:05,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-10-13 10:37:05,179 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:37:05,185 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 7 treesize of output 6 [2024-10-13 10:37:05,569 INFO L349 Elim1Store]: treesize reduction 24, result has 27.3 percent of original size [2024-10-13 10:37:05,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 28 [2024-10-13 10:37:05,662 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 37 treesize of output 28 [2024-10-13 10:37:06,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 49 [2024-10-13 10:37:07,015 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 26 proven. 22 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 10:37:07,016 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:37:08,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792571511] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:37:08,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:37:08,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2024-10-13 10:37:08,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604719266] [2024-10-13 10:37:08,606 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:37:08,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-10-13 10:37:08,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:37:08,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-13 10:37:08,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=2899, Unknown=0, NotChecked=0, Total=3192 [2024-10-13 10:37:08,609 INFO L87 Difference]: Start difference. First operand 144 states and 168 transitions. Second operand has 38 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 38 states have internal predecessors, (60), 6 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 5 states have call successors, (7) [2024-10-13 10:37:11,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:37:11,039 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2024-10-13 10:37:11,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-13 10:37:11,040 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 38 states have internal predecessors, (60), 6 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 5 states have call successors, (7) Word has length 53 [2024-10-13 10:37:11,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:37:11,040 INFO L225 Difference]: With dead ends: 114 [2024-10-13 10:37:11,040 INFO L226 Difference]: Without dead ends: 114 [2024-10-13 10:37:11,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1235 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=640, Invalid=4616, Unknown=0, NotChecked=0, Total=5256 [2024-10-13 10:37:11,042 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 58 mSDsluCounter, 1084 mSDsCounter, 0 mSdLazyCounter, 998 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:37:11,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1136 Invalid, 1022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 998 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 10:37:11,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-13 10:37:11,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2024-10-13 10:37:11,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 75 states have (on average 1.16) internal successors, (87), 83 states have internal predecessors, (87), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 10:37:11,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2024-10-13 10:37:11,045 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 111 transitions. Word has length 53 [2024-10-13 10:37:11,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:37:11,046 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 111 transitions. [2024-10-13 10:37:11,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 38 states have internal predecessors, (60), 6 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 5 states have call successors, (7) [2024-10-13 10:37:11,046 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2024-10-13 10:37:11,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-13 10:37:11,047 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:37:11,047 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 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] [2024-10-13 10:37:11,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-10-13 10:37:11,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:37:11,248 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-13 10:37:11,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:37:11,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1093975880, now seen corresponding path program 1 times [2024-10-13 10:37:11,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:37:11,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605397312] [2024-10-13 10:37:11,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:11,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:37:11,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:11,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:37:11,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:11,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:37:11,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:11,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 10:37:11,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:11,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 10:37:11,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:11,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 10:37:11,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:11,370 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-13 10:37:11,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:37:11,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605397312] [2024-10-13 10:37:11,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605397312] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:37:11,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414805344] [2024-10-13 10:37:11,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:11,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:37:11,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:37:11,373 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:37:11,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-13 10:37:11,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:11,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 10:37:11,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:37:11,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 10:37:11,580 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-13 10:37:11,580 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:37:11,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414805344] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:37:11,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 10:37:11,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 8 [2024-10-13 10:37:11,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333156974] [2024-10-13 10:37:11,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:37:11,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:37:11,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:37:11,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:37:11,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:37:11,582 INFO L87 Difference]: Start difference. First operand 102 states and 111 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-13 10:37:15,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 10:37:19,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 10:37:23,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 10:37:27,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 10:37:27,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:37:27,701 INFO L93 Difference]: Finished difference Result 140 states and 147 transitions. [2024-10-13 10:37:27,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 10:37:27,702 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2024-10-13 10:37:27,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:37:27,702 INFO L225 Difference]: With dead ends: 140 [2024-10-13 10:37:27,702 INFO L226 Difference]: Without dead ends: 140 [2024-10-13 10:37:27,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-13 10:37:27,703 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 47 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 3 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:37:27,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 326 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 114 Invalid, 4 Unknown, 0 Unchecked, 16.1s Time] [2024-10-13 10:37:27,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-10-13 10:37:27,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 126. [2024-10-13 10:37:27,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 93 states have (on average 1.1720430107526882) internal successors, (109), 102 states have internal predecessors, (109), 15 states have call successors, (15), 10 states have call predecessors, (15), 10 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 10:37:27,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 139 transitions. [2024-10-13 10:37:27,708 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 139 transitions. Word has length 55 [2024-10-13 10:37:27,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:37:27,708 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 139 transitions. [2024-10-13 10:37:27,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-13 10:37:27,708 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 139 transitions. [2024-10-13 10:37:27,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-13 10:37:27,709 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:37:27,709 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:37:27,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-10-13 10:37:27,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:37:27,913 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-13 10:37:27,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:37:27,914 INFO L85 PathProgramCache]: Analyzing trace with hash 283675501, now seen corresponding path program 1 times [2024-10-13 10:37:27,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:37:27,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366438407] [2024-10-13 10:37:27,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:27,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:37:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:28,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:37:28,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:28,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:37:28,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:28,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 10:37:28,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:28,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 10:37:28,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:28,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 10:37:28,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:28,094 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-13 10:37:28,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:37:28,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366438407] [2024-10-13 10:37:28,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366438407] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:37:28,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795086704] [2024-10-13 10:37:28,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:28,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:37:28,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:37:28,097 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:37:28,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-13 10:37:28,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:28,206 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-13 10:37:28,208 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:37:28,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 10:37:28,407 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-13 10:37:28,408 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:37:28,465 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 28 treesize of output 24 [2024-10-13 10:37:28,636 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-13 10:37:28,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795086704] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:37:28,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:37:28,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 19 [2024-10-13 10:37:28,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541525501] [2024-10-13 10:37:28,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:37:28,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-13 10:37:28,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:37:28,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-13 10:37:28,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2024-10-13 10:37:28,638 INFO L87 Difference]: Start difference. First operand 126 states and 139 transitions. Second operand has 19 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 17 states have internal predecessors, (68), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-13 10:37:28,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:37:28,867 INFO L93 Difference]: Finished difference Result 137 states and 150 transitions. [2024-10-13 10:37:28,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 10:37:28,867 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 17 states have internal predecessors, (68), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 56 [2024-10-13 10:37:28,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:37:28,868 INFO L225 Difference]: With dead ends: 137 [2024-10-13 10:37:28,868 INFO L226 Difference]: Without dead ends: 137 [2024-10-13 10:37:28,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 110 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=561, Unknown=0, NotChecked=0, Total=702 [2024-10-13 10:37:28,869 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 27 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:37:28,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 691 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:37:28,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-13 10:37:28,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 130. [2024-10-13 10:37:28,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 96 states have (on average 1.1666666666666667) internal successors, (112), 105 states have internal predecessors, (112), 15 states have call successors, (15), 11 states have call predecessors, (15), 11 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 10:37:28,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 142 transitions. [2024-10-13 10:37:28,873 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 142 transitions. Word has length 56 [2024-10-13 10:37:28,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:37:28,874 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 142 transitions. [2024-10-13 10:37:28,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 17 states have internal predecessors, (68), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-13 10:37:28,874 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 142 transitions. [2024-10-13 10:37:28,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-13 10:37:28,874 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:37:28,875 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:37:28,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-10-13 10:37:29,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-10-13 10:37:29,079 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-13 10:37:29,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:37:29,079 INFO L85 PathProgramCache]: Analyzing trace with hash 630198633, now seen corresponding path program 1 times [2024-10-13 10:37:29,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:37:29,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696492469] [2024-10-13 10:37:29,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:29,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:37:29,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:29,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:37:29,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:29,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:37:29,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:29,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 10:37:29,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:29,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 10:37:29,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:29,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-13 10:37:29,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:29,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 10:37:29,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:29,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 10:37:29,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:29,313 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-13 10:37:29,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:37:29,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696492469] [2024-10-13 10:37:29,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696492469] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:37:29,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:37:29,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 10:37:29,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152891017] [2024-10-13 10:37:29,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:37:29,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 10:37:29,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:37:29,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 10:37:29,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-13 10:37:29,316 INFO L87 Difference]: Start difference. First operand 130 states and 142 transitions. Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-13 10:37:29,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:37:29,485 INFO L93 Difference]: Finished difference Result 153 states and 168 transitions. [2024-10-13 10:37:29,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:37:29,485 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 62 [2024-10-13 10:37:29,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:37:29,487 INFO L225 Difference]: With dead ends: 153 [2024-10-13 10:37:29,487 INFO L226 Difference]: Without dead ends: 153 [2024-10-13 10:37:29,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-10-13 10:37:29,488 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 14 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:37:29,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 412 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:37:29,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-10-13 10:37:29,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2024-10-13 10:37:29,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 112 states have (on average 1.1428571428571428) internal successors, (128), 122 states have internal predecessors, (128), 19 states have call successors, (19), 12 states have call predecessors, (19), 12 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-13 10:37:29,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 166 transitions. [2024-10-13 10:37:29,493 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 166 transitions. Word has length 62 [2024-10-13 10:37:29,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:37:29,493 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 166 transitions. [2024-10-13 10:37:29,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-13 10:37:29,493 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 166 transitions. [2024-10-13 10:37:29,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-13 10:37:29,494 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:37:29,494 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:37:29,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-13 10:37:29,495 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2024-10-13 10:37:29,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:37:29,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1673127062, now seen corresponding path program 1 times [2024-10-13 10:37:29,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:37:29,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540953659] [2024-10-13 10:37:29,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:29,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:37:29,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:29,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 10:37:29,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:29,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 10:37:29,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:29,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 10:37:29,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:29,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 10:37:29,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:29,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 10:37:29,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:29,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 10:37:29,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:29,647 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-13 10:37:29,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:37:29,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540953659] [2024-10-13 10:37:29,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540953659] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:37:29,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126211744] [2024-10-13 10:37:29,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:37:29,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:37:29,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:37:29,649 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:37:29,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-10-13 10:37:29,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:37:29,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 10:37:29,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:37:29,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 10:37:29,937 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-13 10:37:29,937 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:37:29,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2024-10-13 10:37:30,072 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-13 10:37:30,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126211744] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:37:30,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:37:30,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 13 [2024-10-13 10:37:30,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525273519] [2024-10-13 10:37:30,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:37:30,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 10:37:30,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:37:30,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 10:37:30,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-10-13 10:37:30,074 INFO L87 Difference]: Start difference. First operand 151 states and 166 transitions. Second operand has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 4 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-13 10:37:34,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 10:37:38,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 10:37:42,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 10:37:46,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]