./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0232_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0232_1-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 b36390e4ace21fb538f0c1df6f562bcf2825b5901fb45d9987e6242615034592 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:55:02,987 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:55:03,066 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 17:55:03,071 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:55:03,073 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:55:03,100 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:55:03,101 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:55:03,101 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:55:03,102 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 17:55:03,104 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 17:55:03,105 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:55:03,105 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:55:03,106 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:55:03,108 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:55:03,108 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:55:03,108 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:55:03,109 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:55:03,109 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:55:03,109 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:55:03,110 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:55:03,110 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 17:55:03,114 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 17:55:03,114 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 17:55:03,115 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:55:03,115 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 17:55:03,115 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:55:03,115 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:55:03,115 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:55:03,116 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:55:03,116 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:55:03,116 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:55:03,116 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 17:55:03,117 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:55:03,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:55:03,117 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:55:03,118 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:55:03,119 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:55:03,130 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:55:03,131 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:55:03,132 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:55:03,132 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:55:03,132 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:55:03,132 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-clean/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-clean/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 -> b36390e4ace21fb538f0c1df6f562bcf2825b5901fb45d9987e6242615034592 [2024-10-11 17:55:03,383 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:55:03,407 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:55:03,411 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:55:03,412 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:55:03,413 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:55:03,414 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2024-10-11 17:55:04,918 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:55:05,149 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:55:05,150 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2024-10-11 17:55:05,168 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/61a76dc6e/9b7994cef821437881a789182cecf565/FLAG356ec9a51 [2024-10-11 17:55:05,181 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/61a76dc6e/9b7994cef821437881a789182cecf565 [2024-10-11 17:55:05,184 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:55:05,185 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:55:05,187 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:55:05,188 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:55:05,194 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:55:05,195 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:55:05" (1/1) ... [2024-10-11 17:55:05,197 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e623027 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:05, skipping insertion in model container [2024-10-11 17:55:05,198 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:55:05" (1/1) ... [2024-10-11 17:55:05,241 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:55:05,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:55:05,585 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:55:05,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:55:05,677 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:55:05,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:05 WrapperNode [2024-10-11 17:55:05,678 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:55:05,679 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:55:05,679 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:55:05,680 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:55:05,687 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:05" (1/1) ... [2024-10-11 17:55:05,707 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:05" (1/1) ... [2024-10-11 17:55:05,734 INFO L138 Inliner]: procedures = 126, calls = 33, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 100 [2024-10-11 17:55:05,735 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:55:05,735 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:55:05,736 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:55:05,736 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:55:05,746 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:05" (1/1) ... [2024-10-11 17:55:05,747 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:05" (1/1) ... [2024-10-11 17:55:05,749 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:05" (1/1) ... [2024-10-11 17:55:05,775 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 10, 8]. 50 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 5 writes are split as follows [0, 3, 2]. [2024-10-11 17:55:05,775 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:05" (1/1) ... [2024-10-11 17:55:05,776 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:05" (1/1) ... [2024-10-11 17:55:05,783 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:05" (1/1) ... [2024-10-11 17:55:05,788 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:05" (1/1) ... [2024-10-11 17:55:05,789 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:05" (1/1) ... [2024-10-11 17:55:05,793 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:05" (1/1) ... [2024-10-11 17:55:05,800 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:55:05,801 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:55:05,804 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:55:05,804 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:55:05,805 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:05" (1/1) ... [2024-10-11 17:55:05,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:55:05,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:55:05,847 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:55:05,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:55:05,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:55:05,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:55:05,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 17:55:05,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 17:55:05,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 17:55:05,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 17:55:05,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 17:55:05,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 17:55:05,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 17:55:05,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:55:05,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 17:55:05,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 17:55:05,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 17:55:05,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 17:55:05,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 17:55:05,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 17:55:05,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:55:05,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:55:06,004 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:55:06,006 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:55:06,290 INFO L? ?]: Removed 98 outVars from TransFormulas that were not future-live. [2024-10-11 17:55:06,290 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:55:06,340 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:55:06,340 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 17:55:06,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:55:06 BoogieIcfgContainer [2024-10-11 17:55:06,341 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:55:06,347 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:55:06,347 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:55:06,352 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:55:06,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:55:05" (1/3) ... [2024-10-11 17:55:06,353 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64edcd6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:55:06, skipping insertion in model container [2024-10-11 17:55:06,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:05" (2/3) ... [2024-10-11 17:55:06,354 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64edcd6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:55:06, skipping insertion in model container [2024-10-11 17:55:06,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:55:06" (3/3) ... [2024-10-11 17:55:06,356 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0232_1-1.i [2024-10-11 17:55:06,374 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:55:06,374 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2024-10-11 17:55:06,429 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:55:06,436 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;@268ff9a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:55:06,437 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2024-10-11 17:55:06,441 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 35 states have (on average 2.4571428571428573) internal successors, (86), 79 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:06,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-11 17:55:06,448 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:06,448 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-11 17:55:06,449 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 17:55:06,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:06,456 INFO L85 PathProgramCache]: Analyzing trace with hash 161642, now seen corresponding path program 1 times [2024-10-11 17:55:06,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:06,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113836311] [2024-10-11 17:55:06,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:06,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:06,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:06,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:06,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:06,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113836311] [2024-10-11 17:55:06,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113836311] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:06,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:06,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:55:06,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453418020] [2024-10-11 17:55:06,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:06,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:55:06,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:06,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:55:06,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:55:06,857 INFO L87 Difference]: Start difference. First operand has 80 states, 35 states have (on average 2.4571428571428573) internal successors, (86), 79 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:07,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:07,067 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2024-10-11 17:55:07,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:55:07,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-11 17:55:07,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:07,076 INFO L225 Difference]: With dead ends: 75 [2024-10-11 17:55:07,076 INFO L226 Difference]: Without dead ends: 74 [2024-10-11 17:55:07,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-11 17:55:07,080 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 74 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:07,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 60 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:55:07,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-11 17:55:07,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-10-11 17:55:07,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 36 states have (on average 2.1944444444444446) internal successors, (79), 73 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:07,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2024-10-11 17:55:07,111 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 3 [2024-10-11 17:55:07,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:07,112 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2024-10-11 17:55:07,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:07,112 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2024-10-11 17:55:07,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-11 17:55:07,112 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:07,112 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-11 17:55:07,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:55:07,113 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 17:55:07,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:07,113 INFO L85 PathProgramCache]: Analyzing trace with hash 161643, now seen corresponding path program 1 times [2024-10-11 17:55:07,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:07,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463553026] [2024-10-11 17:55:07,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:07,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:07,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:07,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:07,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:07,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463553026] [2024-10-11 17:55:07,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463553026] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:07,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:07,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:55:07,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556999722] [2024-10-11 17:55:07,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:07,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:55:07,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:07,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:55:07,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:55:07,287 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:07,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:07,457 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2024-10-11 17:55:07,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:55:07,458 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-11 17:55:07,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:07,459 INFO L225 Difference]: With dead ends: 94 [2024-10-11 17:55:07,460 INFO L226 Difference]: Without dead ends: 94 [2024-10-11 17:55:07,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-11 17:55:07,462 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 72 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:07,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 65 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:07,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-11 17:55:07,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 77. [2024-10-11 17:55:07,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 42 states have (on average 2.0476190476190474) internal successors, (86), 76 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:07,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2024-10-11 17:55:07,476 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 3 [2024-10-11 17:55:07,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:07,476 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2024-10-11 17:55:07,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:07,477 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2024-10-11 17:55:07,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 17:55:07,477 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:07,477 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 17:55:07,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:55:07,478 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 17:55:07,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:07,480 INFO L85 PathProgramCache]: Analyzing trace with hash 5010882, now seen corresponding path program 1 times [2024-10-11 17:55:07,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:07,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919307921] [2024-10-11 17:55:07,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:07,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:07,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:07,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:07,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:07,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919307921] [2024-10-11 17:55:07,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919307921] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:07,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:07,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:55:07,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434854757] [2024-10-11 17:55:07,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:07,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:55:07,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:07,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:55:07,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:55:07,527 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:07,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:07,588 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2024-10-11 17:55:07,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:55:07,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 17:55:07,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:07,590 INFO L225 Difference]: With dead ends: 73 [2024-10-11 17:55:07,590 INFO L226 Difference]: Without dead ends: 73 [2024-10-11 17:55:07,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:55:07,592 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 8 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:07,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 81 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:07,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-11 17:55:07,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-10-11 17:55:07,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 42 states have (on average 1.9523809523809523) internal successors, (82), 72 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:07,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2024-10-11 17:55:07,598 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 4 [2024-10-11 17:55:07,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:07,598 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2024-10-11 17:55:07,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:07,598 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2024-10-11 17:55:07,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 17:55:07,599 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:07,599 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 17:55:07,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:55:07,599 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 17:55:07,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:07,600 INFO L85 PathProgramCache]: Analyzing trace with hash 5010883, now seen corresponding path program 1 times [2024-10-11 17:55:07,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:07,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248081194] [2024-10-11 17:55:07,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:07,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:07,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:07,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:07,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:07,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248081194] [2024-10-11 17:55:07,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248081194] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:07,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:07,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:55:07,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973742671] [2024-10-11 17:55:07,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:07,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:55:07,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:07,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:55:07,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:55:07,682 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:07,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:07,731 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2024-10-11 17:55:07,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:55:07,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 17:55:07,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:07,732 INFO L225 Difference]: With dead ends: 69 [2024-10-11 17:55:07,732 INFO L226 Difference]: Without dead ends: 69 [2024-10-11 17:55:07,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:55:07,734 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 8 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:07,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 86 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:55:07,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-10-11 17:55:07,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-10-11 17:55:07,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 68 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:07,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2024-10-11 17:55:07,739 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 4 [2024-10-11 17:55:07,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:07,739 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2024-10-11 17:55:07,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:07,740 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2024-10-11 17:55:07,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 17:55:07,740 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:07,740 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:07,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:55:07,741 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 17:55:07,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:07,741 INFO L85 PathProgramCache]: Analyzing trace with hash 2086236227, now seen corresponding path program 1 times [2024-10-11 17:55:07,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:07,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560959419] [2024-10-11 17:55:07,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:07,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:07,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:07,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:07,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:07,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560959419] [2024-10-11 17:55:07,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560959419] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:07,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:07,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 17:55:07,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944955458] [2024-10-11 17:55:07,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:07,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 17:55:07,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:07,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 17:55:07,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:55:07,957 INFO L87 Difference]: Start difference. First operand 69 states and 78 transitions. Second operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:08,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:08,164 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2024-10-11 17:55:08,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 17:55:08,165 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-11 17:55:08,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:08,165 INFO L225 Difference]: With dead ends: 76 [2024-10-11 17:55:08,165 INFO L226 Difference]: Without dead ends: 76 [2024-10-11 17:55:08,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-11 17:55:08,167 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 13 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:08,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 300 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:08,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-11 17:55:08,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2024-10-11 17:55:08,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 47 states have (on average 1.7659574468085106) internal successors, (83), 73 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:08,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2024-10-11 17:55:08,172 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 8 [2024-10-11 17:55:08,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:08,173 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2024-10-11 17:55:08,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:08,173 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2024-10-11 17:55:08,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 17:55:08,174 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:08,174 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:08,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:55:08,174 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 17:55:08,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:08,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1991850737, now seen corresponding path program 1 times [2024-10-11 17:55:08,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:08,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828850221] [2024-10-11 17:55:08,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:08,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:08,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:08,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:08,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:08,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828850221] [2024-10-11 17:55:08,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828850221] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:08,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:08,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:55:08,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887376698] [2024-10-11 17:55:08,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:08,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:55:08,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:08,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:55:08,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:55:08,360 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:08,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:08,504 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2024-10-11 17:55:08,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:55:08,508 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-11 17:55:08,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:08,509 INFO L225 Difference]: With dead ends: 92 [2024-10-11 17:55:08,509 INFO L226 Difference]: Without dead ends: 92 [2024-10-11 17:55:08,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:55:08,510 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 55 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:08,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 102 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:08,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-11 17:55:08,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 74. [2024-10-11 17:55:08,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 47 states have (on average 1.7446808510638299) internal successors, (82), 73 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:08,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2024-10-11 17:55:08,516 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 13 [2024-10-11 17:55:08,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:08,517 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2024-10-11 17:55:08,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:08,517 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2024-10-11 17:55:08,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 17:55:08,518 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:08,518 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:08,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:55:08,518 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 17:55:08,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:08,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1991850738, now seen corresponding path program 1 times [2024-10-11 17:55:08,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:08,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593742732] [2024-10-11 17:55:08,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:08,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:08,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:08,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:08,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:08,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593742732] [2024-10-11 17:55:08,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593742732] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:08,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:08,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:55:08,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079213657] [2024-10-11 17:55:08,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:08,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:55:08,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:08,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:55:08,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:55:08,749 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:08,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:08,893 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2024-10-11 17:55:08,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:55:08,894 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-11 17:55:08,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:08,894 INFO L225 Difference]: With dead ends: 85 [2024-10-11 17:55:08,894 INFO L226 Difference]: Without dead ends: 85 [2024-10-11 17:55:08,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:55:08,895 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 58 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:08,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 104 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:08,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-11 17:55:08,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 73. [2024-10-11 17:55:08,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 47 states have (on average 1.702127659574468) internal successors, (80), 72 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:08,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2024-10-11 17:55:08,900 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 13 [2024-10-11 17:55:08,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:08,901 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2024-10-11 17:55:08,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:08,901 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2024-10-11 17:55:08,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 17:55:08,902 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:08,902 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:08,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:55:08,902 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 17:55:08,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:08,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1991836803, now seen corresponding path program 1 times [2024-10-11 17:55:08,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:08,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156467596] [2024-10-11 17:55:08,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:08,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:08,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:08,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:08,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:08,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156467596] [2024-10-11 17:55:08,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156467596] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:08,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:08,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:55:08,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465098580] [2024-10-11 17:55:08,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:08,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:55:08,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:08,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:55:08,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:55:08,955 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:08,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:08,975 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2024-10-11 17:55:08,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:55:08,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-11 17:55:08,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:08,977 INFO L225 Difference]: With dead ends: 56 [2024-10-11 17:55:08,977 INFO L226 Difference]: Without dead ends: 56 [2024-10-11 17:55:08,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11 17:55:08,979 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 27 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:08,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 52 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:55:08,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-11 17:55:08,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-10-11 17:55:08,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 55 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:08,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2024-10-11 17:55:08,984 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 13 [2024-10-11 17:55:08,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:08,984 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2024-10-11 17:55:08,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:08,985 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2024-10-11 17:55:08,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 17:55:08,989 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:08,989 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:08,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:55:08,989 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 17:55:08,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:08,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1993072933, now seen corresponding path program 1 times [2024-10-11 17:55:08,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:08,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686041221] [2024-10-11 17:55:08,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:08,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:09,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:09,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:09,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:09,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686041221] [2024-10-11 17:55:09,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686041221] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:09,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:09,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:55:09,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740294420] [2024-10-11 17:55:09,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:09,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:55:09,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:09,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:55:09,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:55:09,051 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:09,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:09,087 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2024-10-11 17:55:09,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:55:09,088 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-11 17:55:09,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:09,089 INFO L225 Difference]: With dead ends: 54 [2024-10-11 17:55:09,089 INFO L226 Difference]: Without dead ends: 54 [2024-10-11 17:55:09,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-11 17:55:09,090 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 40 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:09,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 84 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:55:09,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-11 17:55:09,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2024-10-11 17:55:09,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 35 states have (on average 1.542857142857143) internal successors, (54), 51 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:09,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2024-10-11 17:55:09,093 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 13 [2024-10-11 17:55:09,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:09,094 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2024-10-11 17:55:09,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:09,094 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2024-10-11 17:55:09,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 17:55:09,094 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:09,095 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:09,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:55:09,095 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 17:55:09,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:09,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1386795632, now seen corresponding path program 1 times [2024-10-11 17:55:09,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:09,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938502976] [2024-10-11 17:55:09,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:09,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:09,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:09,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:09,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:09,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938502976] [2024-10-11 17:55:09,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938502976] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:09,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:09,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:55:09,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439528838] [2024-10-11 17:55:09,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:09,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:55:09,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:09,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:55:09,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:55:09,195 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:09,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:09,261 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2024-10-11 17:55:09,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:55:09,262 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-11 17:55:09,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:09,263 INFO L225 Difference]: With dead ends: 51 [2024-10-11 17:55:09,263 INFO L226 Difference]: Without dead ends: 51 [2024-10-11 17:55:09,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-11 17:55:09,263 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 23 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:09,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 89 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:55:09,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-11 17:55:09,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-10-11 17:55:09,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 50 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:09,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2024-10-11 17:55:09,266 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 15 [2024-10-11 17:55:09,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:09,267 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2024-10-11 17:55:09,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:09,267 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2024-10-11 17:55:09,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 17:55:09,267 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:09,267 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:09,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:55:09,268 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 17:55:09,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:09,268 INFO L85 PathProgramCache]: Analyzing trace with hash -40991519, now seen corresponding path program 1 times [2024-10-11 17:55:09,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:09,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437442287] [2024-10-11 17:55:09,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:09,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:09,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:09,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:09,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:09,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437442287] [2024-10-11 17:55:09,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437442287] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:09,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:09,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:55:09,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205636751] [2024-10-11 17:55:09,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:09,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:55:09,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:09,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:55:09,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:55:09,444 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:09,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:09,523 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2024-10-11 17:55:09,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:55:09,523 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-11 17:55:09,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:09,524 INFO L225 Difference]: With dead ends: 50 [2024-10-11 17:55:09,524 INFO L226 Difference]: Without dead ends: 50 [2024-10-11 17:55:09,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-11 17:55:09,525 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 23 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:09,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 72 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:09,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-11 17:55:09,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-11 17:55:09,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 35 states have (on average 1.4857142857142858) internal successors, (52), 49 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:09,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2024-10-11 17:55:09,528 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 16 [2024-10-11 17:55:09,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:09,528 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2024-10-11 17:55:09,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:09,529 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2024-10-11 17:55:09,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 17:55:09,529 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:09,529 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:09,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:55:09,530 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 17:55:09,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:09,530 INFO L85 PathProgramCache]: Analyzing trace with hash 467993133, now seen corresponding path program 1 times [2024-10-11 17:55:09,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:09,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652242271] [2024-10-11 17:55:09,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:09,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:09,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:09,858 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:09,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:09,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652242271] [2024-10-11 17:55:09,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652242271] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:55:09,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603714941] [2024-10-11 17:55:09,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:09,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:55:09,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:55:09,862 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:55:09,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 17:55:09,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:09,979 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-11 17:55:09,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:55:10,080 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-11 17:55:10,115 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-10-11 17:55:10,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2024-10-11 17:55:10,139 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 17 treesize of output 9 [2024-10-11 17:55:10,171 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-11 17:55:10,208 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 17 treesize of output 9 [2024-10-11 17:55:10,235 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:10,236 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:55:10,295 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-11 17:55:10,372 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:10,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603714941] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:55:10,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:55:10,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-10-11 17:55:10,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033778381] [2024-10-11 17:55:10,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:55:10,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 17:55:10,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:10,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 17:55:10,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-10-11 17:55:10,376 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:10,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:10,656 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2024-10-11 17:55:10,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 17:55:10,657 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-11 17:55:10,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:10,657 INFO L225 Difference]: With dead ends: 51 [2024-10-11 17:55:10,657 INFO L226 Difference]: Without dead ends: 51 [2024-10-11 17:55:10,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2024-10-11 17:55:10,658 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 35 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:10,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 182 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:55:10,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-11 17:55:10,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2024-10-11 17:55:10,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.457142857142857) internal successors, (51), 48 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:10,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2024-10-11 17:55:10,665 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 16 [2024-10-11 17:55:10,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:10,665 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2024-10-11 17:55:10,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:10,665 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2024-10-11 17:55:10,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 17:55:10,666 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:10,666 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:10,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 17:55:10,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 17:55:10,866 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 17:55:10,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:10,867 INFO L85 PathProgramCache]: Analyzing trace with hash 467993134, now seen corresponding path program 1 times [2024-10-11 17:55:10,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:10,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433769599] [2024-10-11 17:55:10,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:10,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:10,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:11,355 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:11,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:11,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433769599] [2024-10-11 17:55:11,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433769599] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:55:11,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536383925] [2024-10-11 17:55:11,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:11,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:55:11,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:55:11,358 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:55:11,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 17:55:11,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:11,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-10-11 17:55:11,494 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:55:11,614 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-11 17:55:11,625 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-11 17:55:11,667 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-11 17:55:11,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-10-11 17:55:11,673 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 24 treesize of output 19 [2024-10-11 17:55:11,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2024-10-11 17:55:11,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-10-11 17:55:11,743 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-11 17:55:11,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 17:55:11,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2024-10-11 17:55:11,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-10-11 17:55:11,824 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:11,825 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:55:12,068 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-11 17:55:12,086 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 66 treesize of output 62 [2024-10-11 17:55:12,090 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 102 treesize of output 94 [2024-10-11 17:55:12,274 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:55:12,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 64 treesize of output 134 [2024-10-11 17:55:12,297 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 68 treesize of output 64 [2024-10-11 17:55:12,495 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:12,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536383925] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:55:12,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:55:12,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2024-10-11 17:55:12,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272878943] [2024-10-11 17:55:12,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:55:12,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-11 17:55:12,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:12,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-11 17:55:12,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2024-10-11 17:55:12,497 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 23 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:12,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:12,969 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2024-10-11 17:55:12,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 17:55:12,970 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 23 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-11 17:55:12,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:12,970 INFO L225 Difference]: With dead ends: 50 [2024-10-11 17:55:12,970 INFO L226 Difference]: Without dead ends: 50 [2024-10-11 17:55:12,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2024-10-11 17:55:12,971 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 62 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:12,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 257 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 17:55:12,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-11 17:55:12,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2024-10-11 17:55:12,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 47 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:12,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2024-10-11 17:55:12,973 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 16 [2024-10-11 17:55:12,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:12,974 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2024-10-11 17:55:12,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.090909090909091) internal successors, (46), 23 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:12,974 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2024-10-11 17:55:12,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 17:55:12,974 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:12,974 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:12,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 17:55:13,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:55:13,175 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 17:55:13,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:13,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1270736974, now seen corresponding path program 1 times [2024-10-11 17:55:13,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:13,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34637147] [2024-10-11 17:55:13,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:13,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:13,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:13,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:13,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:13,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34637147] [2024-10-11 17:55:13,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34637147] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:13,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:13,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:55:13,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831626704] [2024-10-11 17:55:13,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:13,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:55:13,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:13,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:55:13,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:55:13,233 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:13,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:13,302 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2024-10-11 17:55:13,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:55:13,302 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-11 17:55:13,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:13,303 INFO L225 Difference]: With dead ends: 47 [2024-10-11 17:55:13,303 INFO L226 Difference]: Without dead ends: 47 [2024-10-11 17:55:13,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:55:13,305 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 3 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:13,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 80 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:13,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-11 17:55:13,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-10-11 17:55:13,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 35 states have (on average 1.4) internal successors, (49), 46 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:13,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2024-10-11 17:55:13,307 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 17 [2024-10-11 17:55:13,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:13,308 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2024-10-11 17:55:13,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:13,308 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2024-10-11 17:55:13,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 17:55:13,310 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:13,310 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:13,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 17:55:13,310 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 17:55:13,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:13,313 INFO L85 PathProgramCache]: Analyzing trace with hash -738140412, now seen corresponding path program 1 times [2024-10-11 17:55:13,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:13,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612765067] [2024-10-11 17:55:13,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:13,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:13,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:13,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:13,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:13,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612765067] [2024-10-11 17:55:13,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612765067] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:13,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:13,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:55:13,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848678183] [2024-10-11 17:55:13,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:13,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:55:13,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:13,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:55:13,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:55:13,522 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:13,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:13,619 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2024-10-11 17:55:13,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:55:13,620 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-10-11 17:55:13,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:13,620 INFO L225 Difference]: With dead ends: 46 [2024-10-11 17:55:13,621 INFO L226 Difference]: Without dead ends: 46 [2024-10-11 17:55:13,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:55:13,623 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 35 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:13,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 48 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:13,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-11 17:55:13,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-11 17:55:13,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 45 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:13,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2024-10-11 17:55:13,630 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 18 [2024-10-11 17:55:13,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:13,630 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2024-10-11 17:55:13,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:13,630 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2024-10-11 17:55:13,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 17:55:13,630 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:13,631 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:13,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 17:55:13,631 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 17:55:13,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:13,631 INFO L85 PathProgramCache]: Analyzing trace with hash -738140411, now seen corresponding path program 1 times [2024-10-11 17:55:13,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:13,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233667398] [2024-10-11 17:55:13,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:13,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:13,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:13,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:13,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:55:13,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233667398] [2024-10-11 17:55:13,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233667398] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:13,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:13,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:55:13,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536726521] [2024-10-11 17:55:13,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:13,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:55:13,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:55:13,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:55:13,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:55:13,698 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:13,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:13,736 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2024-10-11 17:55:13,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:55:13,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-10-11 17:55:13,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:13,737 INFO L225 Difference]: With dead ends: 42 [2024-10-11 17:55:13,737 INFO L226 Difference]: Without dead ends: 42 [2024-10-11 17:55:13,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:55:13,738 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 47 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:13,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 19 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:55:13,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-11 17:55:13,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-11 17:55:13,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 41 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:13,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2024-10-11 17:55:13,740 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 18 [2024-10-11 17:55:13,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:13,741 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2024-10-11 17:55:13,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:13,741 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2024-10-11 17:55:13,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 17:55:13,742 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:13,742 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:13,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 17:55:13,742 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 17:55:13,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:13,743 INFO L85 PathProgramCache]: Analyzing trace with hash 293159117, now seen corresponding path program 1 times [2024-10-11 17:55:13,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:55:13,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101586105] [2024-10-11 17:55:13,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:13,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:55:13,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:55:13,767 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 17:55:13,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:55:13,816 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 17:55:13,816 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 17:55:13,817 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK (43 of 44 remaining) [2024-10-11 17:55:13,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 44 remaining) [2024-10-11 17:55:13,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 44 remaining) [2024-10-11 17:55:13,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 44 remaining) [2024-10-11 17:55:13,821 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 44 remaining) [2024-10-11 17:55:13,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 44 remaining) [2024-10-11 17:55:13,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 44 remaining) [2024-10-11 17:55:13,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 44 remaining) [2024-10-11 17:55:13,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 44 remaining) [2024-10-11 17:55:13,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 44 remaining) [2024-10-11 17:55:13,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 44 remaining) [2024-10-11 17:55:13,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 44 remaining) [2024-10-11 17:55:13,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 44 remaining) [2024-10-11 17:55:13,822 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 44 remaining) [2024-10-11 17:55:13,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 44 remaining) [2024-10-11 17:55:13,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 44 remaining) [2024-10-11 17:55:13,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 44 remaining) [2024-10-11 17:55:13,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 44 remaining) [2024-10-11 17:55:13,823 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 44 remaining) [2024-10-11 17:55:13,825 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (24 of 44 remaining) [2024-10-11 17:55:13,825 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE (23 of 44 remaining) [2024-10-11 17:55:13,825 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE (22 of 44 remaining) [2024-10-11 17:55:13,826 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 44 remaining) [2024-10-11 17:55:13,826 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 44 remaining) [2024-10-11 17:55:13,826 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 44 remaining) [2024-10-11 17:55:13,826 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 44 remaining) [2024-10-11 17:55:13,826 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 44 remaining) [2024-10-11 17:55:13,826 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 44 remaining) [2024-10-11 17:55:13,826 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE (15 of 44 remaining) [2024-10-11 17:55:13,826 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE (14 of 44 remaining) [2024-10-11 17:55:13,827 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE (13 of 44 remaining) [2024-10-11 17:55:13,827 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 44 remaining) [2024-10-11 17:55:13,827 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 44 remaining) [2024-10-11 17:55:13,827 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 44 remaining) [2024-10-11 17:55:13,827 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 44 remaining) [2024-10-11 17:55:13,827 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 44 remaining) [2024-10-11 17:55:13,827 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 44 remaining) [2024-10-11 17:55:13,827 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 44 remaining) [2024-10-11 17:55:13,827 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 44 remaining) [2024-10-11 17:55:13,828 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE (4 of 44 remaining) [2024-10-11 17:55:13,828 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE (3 of 44 remaining) [2024-10-11 17:55:13,828 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE (2 of 44 remaining) [2024-10-11 17:55:13,828 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 44 remaining) [2024-10-11 17:55:13,828 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 44 remaining) [2024-10-11 17:55:13,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 17:55:13,834 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:13,866 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 17:55:13,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 05:55:13 BoogieIcfgContainer [2024-10-11 17:55:13,870 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 17:55:13,871 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 17:55:13,871 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 17:55:13,871 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 17:55:13,871 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:55:06" (3/4) ... [2024-10-11 17:55:13,873 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 17:55:13,874 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 17:55:13,875 INFO L158 Benchmark]: Toolchain (without parser) took 8689.75ms. Allocated memory was 184.5MB in the beginning and 314.6MB in the end (delta: 130.0MB). Free memory was 128.3MB in the beginning and 206.7MB in the end (delta: -78.4MB). Peak memory consumption was 53.7MB. Max. memory is 16.1GB. [2024-10-11 17:55:13,875 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 184.5MB. Free memory was 150.3MB in the beginning and 150.0MB in the end (delta: 285.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:55:13,876 INFO L158 Benchmark]: CACSL2BoogieTranslator took 491.22ms. Allocated memory is still 184.5MB. Free memory was 128.3MB in the beginning and 108.4MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 17:55:13,876 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.45ms. Allocated memory is still 184.5MB. Free memory was 108.4MB in the beginning and 106.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:55:13,876 INFO L158 Benchmark]: Boogie Preprocessor took 64.69ms. Allocated memory is still 184.5MB. Free memory was 106.1MB in the beginning and 103.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:55:13,876 INFO L158 Benchmark]: RCFGBuilder took 540.17ms. Allocated memory is still 184.5MB. Free memory was 103.6MB in the beginning and 77.6MB in the end (delta: 26.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-11 17:55:13,877 INFO L158 Benchmark]: TraceAbstraction took 7523.31ms. Allocated memory was 184.5MB in the beginning and 314.6MB in the end (delta: 130.0MB). Free memory was 77.2MB in the beginning and 207.8MB in the end (delta: -130.6MB). Peak memory consumption was 1.3MB. Max. memory is 16.1GB. [2024-10-11 17:55:13,877 INFO L158 Benchmark]: Witness Printer took 3.94ms. Allocated memory is still 314.6MB. Free memory was 207.8MB in the beginning and 206.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:55:13,878 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 184.5MB. Free memory was 150.3MB in the beginning and 150.0MB in the end (delta: 285.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 491.22ms. Allocated memory is still 184.5MB. Free memory was 128.3MB in the beginning and 108.4MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.45ms. Allocated memory is still 184.5MB. Free memory was 108.4MB in the beginning and 106.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.69ms. Allocated memory is still 184.5MB. Free memory was 106.1MB in the beginning and 103.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 540.17ms. Allocated memory is still 184.5MB. Free memory was 103.6MB in the beginning and 77.6MB in the end (delta: 26.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 7523.31ms. Allocated memory was 184.5MB in the beginning and 314.6MB in the end (delta: 130.0MB). Free memory was 77.2MB in the beginning and 207.8MB in the end (delta: -130.6MB). Peak memory consumption was 1.3MB. Max. memory is 16.1GB. * Witness Printer took 3.94ms. Allocated memory is still 314.6MB. Free memory was 207.8MB in the beginning and 206.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 539]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 539. Possible FailurePath: [L524] int c = 0; [L541] struct item *list = ((void *)0); [L541] struct item *list = ((void *)0); [L542] int length = 0; VAL [c=0, length=0, list={6:0}] [L544] CALL append(&list) [L531] c++ [L532] struct item *item = malloc(sizeof *item); [L533] EXPR \read(**plist) VAL [c=1] [L533] item->next = *plist [L534] EXPR item->next VAL [c=1] [L534-L536] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L534-L536] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [c=1, item={3:0}, plist={6:0}] [L534-L536] item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L537] *plist = item [L544] RET append(&list) [L545] length++ [L546] COND FALSE !(__VERIFIER_nondet_int() && c < 20) [L547] COND TRUE length > 0 VAL [c=1] [L548] COND FALSE !(length < 0) VAL [c=1] [L551] EXPR \read(*list) VAL [c=1] [L551] EXPR list->next [L551] struct item *next = list->next; [L552] EXPR \read(*list) VAL [c=1] [L552] free(list) VAL [c=1, length=1, list={6:0}, next={0:0}] [L552] free(list) VAL [c=1, length=1, list={6:0}, next={0:0}] [L552] free(list) [L553] list = next [L554] length-- [L556] COND FALSE !(length > 0) VAL [c=1, list={6:0}] [L562] return 0; [L541] struct item *list = ((void *)0); [L562] return 0; VAL [\result=0, c=1] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 549]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 549]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 549]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 558]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 558]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 558]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 80 locations, 44 error locations. Started 1 CEGAR loops. OverallTime: 7.4s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 583 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 583 mSDsluCounter, 1681 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1128 mSDsCounter, 77 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1727 IncrementalHoareTripleChecker+Invalid, 1804 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 77 mSolverCounterUnsat, 553 mSDtfsCounter, 1727 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 150 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=0, InterpolantAutomatonStates: 81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 55 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 243 NumberOfCodeBlocks, 243 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 234 ConstructedInterpolants, 4 QuantifiedInterpolants, 2192 SizeOfPredicates, 28 NumberOfNonLiveVariables, 428 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 20 InterpolantComputations, 14 PerfectInterpolantSequences, 6/30 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 17:55:13,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0232_1-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 b36390e4ace21fb538f0c1df6f562bcf2825b5901fb45d9987e6242615034592 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:55:16,153 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:55:16,236 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-11 17:55:16,244 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:55:16,245 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:55:16,274 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:55:16,275 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:55:16,275 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:55:16,276 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 17:55:16,278 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 17:55:16,279 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:55:16,279 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:55:16,280 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:55:16,280 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:55:16,280 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:55:16,281 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:55:16,281 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:55:16,281 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:55:16,281 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:55:16,282 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:55:16,282 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 17:55:16,286 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 17:55:16,287 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 17:55:16,287 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:55:16,287 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 17:55:16,287 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 17:55:16,288 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:55:16,288 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 17:55:16,288 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:55:16,288 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:55:16,289 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:55:16,289 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:55:16,289 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:55:16,289 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 17:55:16,290 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:55:16,298 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:55:16,298 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:55:16,299 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:55:16,299 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 17:55:16,299 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 17:55:16,300 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:55:16,302 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:55:16,302 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:55:16,302 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:55:16,302 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 17:55:16,303 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-clean/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-clean/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 -> b36390e4ace21fb538f0c1df6f562bcf2825b5901fb45d9987e6242615034592 [2024-10-11 17:55:16,632 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:55:16,658 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:55:16,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:55:16,663 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:55:16,664 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:55:16,665 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2024-10-11 17:55:18,292 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:55:18,580 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:55:18,581 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0232_1-1.i [2024-10-11 17:55:18,601 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f7e8b3763/924078518769495091dd313f0f81d486/FLAG0435b1628 [2024-10-11 17:55:18,883 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f7e8b3763/924078518769495091dd313f0f81d486 [2024-10-11 17:55:18,886 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:55:18,887 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:55:18,888 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:55:18,889 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:55:18,896 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:55:18,897 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:55:18" (1/1) ... [2024-10-11 17:55:18,898 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@612c8afa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:18, skipping insertion in model container [2024-10-11 17:55:18,898 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:55:18" (1/1) ... [2024-10-11 17:55:18,943 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:55:19,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:55:19,332 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:55:19,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:55:19,435 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:55:19,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:19 WrapperNode [2024-10-11 17:55:19,437 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:55:19,438 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:55:19,438 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:55:19,439 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:55:19,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:19" (1/1) ... [2024-10-11 17:55:19,469 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:19" (1/1) ... [2024-10-11 17:55:19,494 INFO L138 Inliner]: procedures = 127, calls = 33, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 100 [2024-10-11 17:55:19,495 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:55:19,495 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:55:19,496 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:55:19,496 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:55:19,507 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:19" (1/1) ... [2024-10-11 17:55:19,507 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:19" (1/1) ... [2024-10-11 17:55:19,512 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:19" (1/1) ... [2024-10-11 17:55:19,533 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 10, 8]. 50 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 5 writes are split as follows [0, 3, 2]. [2024-10-11 17:55:19,534 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:19" (1/1) ... [2024-10-11 17:55:19,534 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:19" (1/1) ... [2024-10-11 17:55:19,548 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:19" (1/1) ... [2024-10-11 17:55:19,551 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:19" (1/1) ... [2024-10-11 17:55:19,557 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:19" (1/1) ... [2024-10-11 17:55:19,559 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:19" (1/1) ... [2024-10-11 17:55:19,562 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:55:19,564 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:55:19,564 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:55:19,564 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:55:19,565 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:19" (1/1) ... [2024-10-11 17:55:19,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:55:19,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:55:19,604 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:55:19,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:55:19,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:55:19,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:55:19,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 17:55:19,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 17:55:19,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 17:55:19,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 17:55:19,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 17:55:19,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 17:55:19,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 17:55:19,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:55:19,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 17:55:19,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 17:55:19,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 17:55:19,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 17:55:19,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 17:55:19,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 17:55:19,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:55:19,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:55:19,792 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:55:19,794 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:55:20,308 INFO L? ?]: Removed 98 outVars from TransFormulas that were not future-live. [2024-10-11 17:55:20,308 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:55:20,363 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:55:20,365 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 17:55:20,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:55:20 BoogieIcfgContainer [2024-10-11 17:55:20,366 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:55:20,368 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:55:20,368 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:55:20,372 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:55:20,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:55:18" (1/3) ... [2024-10-11 17:55:20,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c2bdd43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:55:20, skipping insertion in model container [2024-10-11 17:55:20,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:55:19" (2/3) ... [2024-10-11 17:55:20,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c2bdd43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:55:20, skipping insertion in model container [2024-10-11 17:55:20,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:55:20" (3/3) ... [2024-10-11 17:55:20,375 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0232_1-1.i [2024-10-11 17:55:20,392 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:55:20,392 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2024-10-11 17:55:20,433 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:55:20,440 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;@b18db42, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:55:20,440 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2024-10-11 17:55:20,444 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 35 states have (on average 2.4571428571428573) internal successors, (86), 79 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:20,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-11 17:55:20,449 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:20,449 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-11 17:55:20,450 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 17:55:20,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:20,454 INFO L85 PathProgramCache]: Analyzing trace with hash 161642, now seen corresponding path program 1 times [2024-10-11 17:55:20,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:55:20,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1486915301] [2024-10-11 17:55:20,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:20,463 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:55:20,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:55:20,466 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:55:20,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 17:55:20,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:20,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 17:55:20,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:55:20,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 17:55:20,686 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-11 17:55:20,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-10-11 17:55:20,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:20,709 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:55:20,709 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:55:20,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1486915301] [2024-10-11 17:55:20,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1486915301] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:20,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:20,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:55:20,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261510593] [2024-10-11 17:55:20,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:20,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:55:20,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:55:20,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:55:20,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:55:20,752 INFO L87 Difference]: Start difference. First operand has 80 states, 35 states have (on average 2.4571428571428573) internal successors, (86), 79 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:21,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:21,037 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2024-10-11 17:55:21,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:55:21,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-11 17:55:21,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:21,047 INFO L225 Difference]: With dead ends: 75 [2024-10-11 17:55:21,048 INFO L226 Difference]: Without dead ends: 74 [2024-10-11 17:55:21,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-11 17:55:21,052 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 74 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:21,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 60 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:55:21,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-11 17:55:21,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-10-11 17:55:21,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 36 states have (on average 2.1944444444444446) internal successors, (79), 73 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:21,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2024-10-11 17:55:21,085 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 3 [2024-10-11 17:55:21,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:21,086 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2024-10-11 17:55:21,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:21,086 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2024-10-11 17:55:21,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-11 17:55:21,086 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:21,087 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-11 17:55:21,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 17:55:21,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:55:21,290 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 17:55:21,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:21,291 INFO L85 PathProgramCache]: Analyzing trace with hash 161643, now seen corresponding path program 1 times [2024-10-11 17:55:21,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:55:21,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1840455722] [2024-10-11 17:55:21,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:21,292 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:55:21,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:55:21,294 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:55:21,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 17:55:21,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:21,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 17:55:21,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:55:21,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 17:55:21,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 17:55:21,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 17:55:21,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 17:55:21,506 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 17:55:21,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-11 17:55:21,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:21,521 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:55:21,521 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:55:21,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1840455722] [2024-10-11 17:55:21,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1840455722] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:21,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:21,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:55:21,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738720286] [2024-10-11 17:55:21,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:21,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:55:21,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:55:21,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:55:21,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:55:21,524 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:21,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:21,819 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2024-10-11 17:55:21,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:55:21,820 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-11 17:55:21,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:21,821 INFO L225 Difference]: With dead ends: 99 [2024-10-11 17:55:21,821 INFO L226 Difference]: Without dead ends: 99 [2024-10-11 17:55:21,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-11 17:55:21,822 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 73 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:21,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 65 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 17:55:21,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-11 17:55:21,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 80. [2024-10-11 17:55:21,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 44 states have (on average 2.0681818181818183) internal successors, (91), 79 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:21,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 91 transitions. [2024-10-11 17:55:21,834 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 91 transitions. Word has length 3 [2024-10-11 17:55:21,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:21,835 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 91 transitions. [2024-10-11 17:55:21,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:21,836 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 91 transitions. [2024-10-11 17:55:21,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 17:55:21,836 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:21,837 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 17:55:21,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-11 17:55:22,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:55:22,038 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 17:55:22,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:22,039 INFO L85 PathProgramCache]: Analyzing trace with hash 5010882, now seen corresponding path program 1 times [2024-10-11 17:55:22,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:55:22,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [501688303] [2024-10-11 17:55:22,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:22,048 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:55:22,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:55:22,051 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:55:22,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 17:55:22,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:22,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 17:55:22,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:55:22,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 17:55:22,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:22,121 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:55:22,122 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:55:22,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [501688303] [2024-10-11 17:55:22,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [501688303] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:22,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:22,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:55:22,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720745984] [2024-10-11 17:55:22,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:22,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:55:22,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:55:22,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:55:22,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:55:22,124 INFO L87 Difference]: Start difference. First operand 80 states and 91 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:22,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:22,264 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2024-10-11 17:55:22,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:55:22,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 17:55:22,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:22,266 INFO L225 Difference]: With dead ends: 76 [2024-10-11 17:55:22,266 INFO L226 Difference]: Without dead ends: 76 [2024-10-11 17:55:22,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11 17:55:22,268 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 9 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:22,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 82 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:22,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-11 17:55:22,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-10-11 17:55:22,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 44 states have (on average 1.9545454545454546) internal successors, (86), 75 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:22,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2024-10-11 17:55:22,275 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 4 [2024-10-11 17:55:22,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:22,276 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2024-10-11 17:55:22,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:22,276 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2024-10-11 17:55:22,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 17:55:22,280 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:22,280 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 17:55:22,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 17:55:22,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:55:22,481 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 17:55:22,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:22,482 INFO L85 PathProgramCache]: Analyzing trace with hash 5010883, now seen corresponding path program 1 times [2024-10-11 17:55:22,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:55:22,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1930317534] [2024-10-11 17:55:22,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:22,482 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:55:22,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:55:22,486 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:55:22,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 17:55:22,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:22,547 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 17:55:22,548 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:55:22,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 17:55:22,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:22,582 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:55:22,582 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:55:22,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1930317534] [2024-10-11 17:55:22,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1930317534] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:22,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:22,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:55:22,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009241778] [2024-10-11 17:55:22,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:22,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:55:22,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:55:22,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:55:22,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:55:22,586 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:22,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:22,736 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2024-10-11 17:55:22,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:55:22,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 17:55:22,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:22,737 INFO L225 Difference]: With dead ends: 72 [2024-10-11 17:55:22,737 INFO L226 Difference]: Without dead ends: 72 [2024-10-11 17:55:22,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11 17:55:22,739 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 9 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:22,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 86 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:22,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-11 17:55:22,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-10-11 17:55:22,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 44 states have (on average 1.8409090909090908) internal successors, (81), 71 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:22,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2024-10-11 17:55:22,745 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 4 [2024-10-11 17:55:22,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:22,746 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2024-10-11 17:55:22,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:22,746 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2024-10-11 17:55:22,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 17:55:22,746 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:22,746 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:22,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-11 17:55:22,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:55:22,947 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 17:55:22,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:22,948 INFO L85 PathProgramCache]: Analyzing trace with hash 2086236227, now seen corresponding path program 1 times [2024-10-11 17:55:22,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:55:22,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [759909443] [2024-10-11 17:55:22,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:22,948 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:55:22,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:55:22,950 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:55:22,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 17:55:23,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:23,018 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 17:55:23,020 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:55:23,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 17:55:23,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 17:55:23,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:23,169 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:55:23,169 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:55:23,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [759909443] [2024-10-11 17:55:23,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [759909443] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:23,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:23,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 17:55:23,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642449789] [2024-10-11 17:55:23,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:23,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 17:55:23,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:55:23,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 17:55:23,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:55:23,171 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:23,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:23,582 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2024-10-11 17:55:23,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 17:55:23,582 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-11 17:55:23,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:23,583 INFO L225 Difference]: With dead ends: 80 [2024-10-11 17:55:23,583 INFO L226 Difference]: Without dead ends: 80 [2024-10-11 17:55:23,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-11 17:55:23,584 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 15 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:23,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 302 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 17:55:23,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-11 17:55:23,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2024-10-11 17:55:23,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 49 states have (on average 1.7551020408163265) internal successors, (86), 76 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:23,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2024-10-11 17:55:23,589 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 8 [2024-10-11 17:55:23,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:23,590 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2024-10-11 17:55:23,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:23,590 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2024-10-11 17:55:23,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 17:55:23,591 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:23,591 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:23,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-11 17:55:23,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:55:23,792 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 17:55:23,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:23,792 INFO L85 PathProgramCache]: Analyzing trace with hash 2086248360, now seen corresponding path program 1 times [2024-10-11 17:55:23,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:55:23,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1244560389] [2024-10-11 17:55:23,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:23,793 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:55:23,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:55:23,794 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:55:23,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-11 17:55:23,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:23,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 17:55:23,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:55:23,886 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-11 17:55:23,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 17:55:23,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 17:55:23,961 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 17:55:23,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-11 17:55:23,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:23,981 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:55:23,981 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:55:23,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1244560389] [2024-10-11 17:55:23,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1244560389] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:23,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:23,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:55:23,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73343329] [2024-10-11 17:55:23,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:23,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:55:23,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:55:23,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:55:23,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:55:23,983 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:24,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:24,160 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2024-10-11 17:55:24,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:55:24,161 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-11 17:55:24,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:24,162 INFO L225 Difference]: With dead ends: 76 [2024-10-11 17:55:24,162 INFO L226 Difference]: Without dead ends: 76 [2024-10-11 17:55:24,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:55:24,163 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 63 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:24,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 98 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:55:24,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-11 17:55:24,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2024-10-11 17:55:24,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 47 states have (on average 1.7659574468085106) internal successors, (83), 73 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:24,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2024-10-11 17:55:24,169 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 8 [2024-10-11 17:55:24,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:24,169 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2024-10-11 17:55:24,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:24,169 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2024-10-11 17:55:24,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 17:55:24,170 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:24,170 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:24,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-11 17:55:24,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:55:24,377 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 17:55:24,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:24,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1991850737, now seen corresponding path program 1 times [2024-10-11 17:55:24,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:55:24,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1696507001] [2024-10-11 17:55:24,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:24,378 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:55:24,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:55:24,380 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:55:24,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-11 17:55:24,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:24,455 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 17:55:24,457 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:55:24,526 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-11 17:55:24,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-11 17:55:24,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:24,562 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:55:24,562 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:55:24,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1696507001] [2024-10-11 17:55:24,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1696507001] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:24,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:24,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:55:24,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317401468] [2024-10-11 17:55:24,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:24,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:55:24,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:55:24,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:55:24,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:55:24,564 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:24,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:24,870 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2024-10-11 17:55:24,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:55:24,870 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-11 17:55:24,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:24,870 INFO L225 Difference]: With dead ends: 92 [2024-10-11 17:55:24,871 INFO L226 Difference]: Without dead ends: 92 [2024-10-11 17:55:24,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:55:24,871 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 55 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:24,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 102 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 17:55:24,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-11 17:55:24,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 74. [2024-10-11 17:55:24,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 47 states have (on average 1.7446808510638299) internal successors, (82), 73 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:24,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2024-10-11 17:55:24,882 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 13 [2024-10-11 17:55:24,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:24,883 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2024-10-11 17:55:24,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:24,883 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2024-10-11 17:55:24,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 17:55:24,884 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:24,884 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:24,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-10-11 17:55:25,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:55:25,085 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 17:55:25,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:25,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1991850738, now seen corresponding path program 1 times [2024-10-11 17:55:25,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:55:25,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2045290669] [2024-10-11 17:55:25,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:25,086 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:55:25,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:55:25,087 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:55:25,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-11 17:55:25,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:25,173 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 17:55:25,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:55:25,273 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-11 17:55:25,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 17:55:25,329 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 17 treesize of output 9 [2024-10-11 17:55:25,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:25,340 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:55:25,341 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:55:25,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2045290669] [2024-10-11 17:55:25,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2045290669] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:25,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:25,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:55:25,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101792785] [2024-10-11 17:55:25,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:25,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:55:25,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:55:25,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:55:25,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:55:25,342 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:25,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:25,678 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2024-10-11 17:55:25,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:55:25,678 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-11 17:55:25,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:25,679 INFO L225 Difference]: With dead ends: 85 [2024-10-11 17:55:25,679 INFO L226 Difference]: Without dead ends: 85 [2024-10-11 17:55:25,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:55:25,680 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 53 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:25,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 133 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 17:55:25,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-11 17:55:25,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 73. [2024-10-11 17:55:25,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 47 states have (on average 1.702127659574468) internal successors, (80), 72 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:25,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2024-10-11 17:55:25,684 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 13 [2024-10-11 17:55:25,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:25,684 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2024-10-11 17:55:25,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:25,685 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2024-10-11 17:55:25,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 17:55:25,685 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:25,685 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:25,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-11 17:55:25,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:55:25,886 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 17:55:25,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:25,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1991836803, now seen corresponding path program 1 times [2024-10-11 17:55:25,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:55:25,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1122518978] [2024-10-11 17:55:25,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:25,887 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:55:25,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:55:25,890 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:55:25,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-11 17:55:25,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:25,971 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 17:55:25,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:55:25,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:25,996 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:55:25,996 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:55:25,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1122518978] [2024-10-11 17:55:25,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1122518978] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:25,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:25,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:55:25,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476588193] [2024-10-11 17:55:25,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:25,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:55:25,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:55:25,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:55:25,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:55:25,998 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:26,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:26,132 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2024-10-11 17:55:26,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:55:26,133 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-11 17:55:26,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:26,134 INFO L225 Difference]: With dead ends: 102 [2024-10-11 17:55:26,134 INFO L226 Difference]: Without dead ends: 102 [2024-10-11 17:55:26,134 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-11 17:55:26,135 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 24 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:26,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 157 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:26,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-11 17:55:26,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 86. [2024-10-11 17:55:26,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 60 states have (on average 1.65) internal successors, (99), 85 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:26,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. [2024-10-11 17:55:26,144 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 99 transitions. Word has length 13 [2024-10-11 17:55:26,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:26,144 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 99 transitions. [2024-10-11 17:55:26,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:26,144 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2024-10-11 17:55:26,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 17:55:26,145 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:26,145 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:26,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-11 17:55:26,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:55:26,346 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 17:55:26,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:26,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1386795632, now seen corresponding path program 1 times [2024-10-11 17:55:26,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:55:26,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2041672785] [2024-10-11 17:55:26,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:26,347 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:55:26,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:55:26,350 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:55:26,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-11 17:55:26,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:26,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 17:55:26,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:55:26,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 17:55:26,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:26,553 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:55:26,553 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:55:26,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2041672785] [2024-10-11 17:55:26,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2041672785] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:26,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:26,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:55:26,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289811379] [2024-10-11 17:55:26,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:26,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:55:26,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:55:26,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:55:26,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:55:26,555 INFO L87 Difference]: Start difference. First operand 86 states and 99 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:26,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:26,735 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2024-10-11 17:55:26,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:55:26,736 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-11 17:55:26,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:26,736 INFO L225 Difference]: With dead ends: 95 [2024-10-11 17:55:26,736 INFO L226 Difference]: Without dead ends: 95 [2024-10-11 17:55:26,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 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-11 17:55:26,737 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 49 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 120 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.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:26,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 120 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:55:26,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-11 17:55:26,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 85. [2024-10-11 17:55:26,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 60 states have (on average 1.6166666666666667) internal successors, (97), 84 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:26,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 97 transitions. [2024-10-11 17:55:26,740 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 97 transitions. Word has length 15 [2024-10-11 17:55:26,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:26,741 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 97 transitions. [2024-10-11 17:55:26,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:26,741 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 97 transitions. [2024-10-11 17:55:26,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 17:55:26,741 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:26,741 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:26,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-11 17:55:26,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:55:26,946 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 17:55:26,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:26,946 INFO L85 PathProgramCache]: Analyzing trace with hash -40991519, now seen corresponding path program 1 times [2024-10-11 17:55:26,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:55:26,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1561035608] [2024-10-11 17:55:26,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:26,947 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:55:26,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:55:26,948 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:55:26,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-11 17:55:27,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:27,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 17:55:27,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:55:27,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 17:55:27,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 17:55:27,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:27,218 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:55:27,218 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:55:27,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1561035608] [2024-10-11 17:55:27,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1561035608] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:27,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:27,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:55:27,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996431604] [2024-10-11 17:55:27,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:27,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:55:27,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:55:27,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:55:27,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:55:27,220 INFO L87 Difference]: Start difference. First operand 85 states and 97 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:27,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:27,572 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2024-10-11 17:55:27,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 17:55:27,573 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-11 17:55:27,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:27,573 INFO L225 Difference]: With dead ends: 94 [2024-10-11 17:55:27,573 INFO L226 Difference]: Without dead ends: 94 [2024-10-11 17:55:27,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:55:27,574 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 107 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:27,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 95 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 17:55:27,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-11 17:55:27,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 84. [2024-10-11 17:55:27,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 60 states have (on average 1.5833333333333333) internal successors, (95), 83 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:27,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 95 transitions. [2024-10-11 17:55:27,578 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 95 transitions. Word has length 16 [2024-10-11 17:55:27,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:27,578 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 95 transitions. [2024-10-11 17:55:27,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:27,578 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 95 transitions. [2024-10-11 17:55:27,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 17:55:27,579 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:27,579 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:27,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-10-11 17:55:27,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:55:27,780 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 17:55:27,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:27,780 INFO L85 PathProgramCache]: Analyzing trace with hash 467993133, now seen corresponding path program 1 times [2024-10-11 17:55:27,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:55:27,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2067272981] [2024-10-11 17:55:27,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:27,781 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:55:27,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:55:27,784 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:55:27,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-11 17:55:27,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:27,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-11 17:55:27,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:55:27,959 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-11 17:55:27,988 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-11 17:55:28,015 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2024-10-11 17:55:28,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2024-10-11 17:55:28,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-11 17:55:28,065 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-11 17:55:28,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-11 17:55:28,146 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:28,147 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:55:28,256 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 36 treesize of output 32 [2024-10-11 17:55:28,388 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:28,388 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:55:28,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2067272981] [2024-10-11 17:55:28,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2067272981] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:55:28,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:55:28,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2024-10-11 17:55:28,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301210079] [2024-10-11 17:55:28,389 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:55:28,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 17:55:28,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:55:28,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 17:55:28,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-10-11 17:55:28,390 INFO L87 Difference]: Start difference. First operand 84 states and 95 transitions. Second operand has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:29,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:29,092 INFO L93 Difference]: Finished difference Result 96 states and 105 transitions. [2024-10-11 17:55:29,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 17:55:29,093 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-11 17:55:29,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:29,093 INFO L225 Difference]: With dead ends: 96 [2024-10-11 17:55:29,093 INFO L226 Difference]: Without dead ends: 96 [2024-10-11 17:55:29,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2024-10-11 17:55:29,094 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 69 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:29,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 273 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 17:55:29,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-11 17:55:29,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 83. [2024-10-11 17:55:29,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 60 states have (on average 1.5666666666666667) internal successors, (94), 82 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:29,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 94 transitions. [2024-10-11 17:55:29,098 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 94 transitions. Word has length 16 [2024-10-11 17:55:29,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:29,098 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 94 transitions. [2024-10-11 17:55:29,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:29,098 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 94 transitions. [2024-10-11 17:55:29,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 17:55:29,099 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:29,099 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:29,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-11 17:55:29,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:55:29,303 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 17:55:29,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:29,303 INFO L85 PathProgramCache]: Analyzing trace with hash 467993134, now seen corresponding path program 1 times [2024-10-11 17:55:29,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:55:29,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1351143760] [2024-10-11 17:55:29,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:29,304 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:55:29,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:55:29,305 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:55:29,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-11 17:55:29,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:29,441 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-11 17:55:29,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:55:29,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 17:55:29,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 17:55:29,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 17:55:29,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-11 17:55:29,597 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 17:55:29,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-11 17:55:29,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 17:55:29,656 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-11 17:55:29,699 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2024-10-11 17:55:29,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2024-10-11 17:55:29,731 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 17 treesize of output 9 [2024-10-11 17:55:29,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 17:55:29,769 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-11 17:55:29,814 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 17 treesize of output 9 [2024-10-11 17:55:29,827 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 7 treesize of output 3 [2024-10-11 17:55:29,859 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:29,859 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:55:30,220 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 40 treesize of output 32 [2024-10-11 17:55:30,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 17:55:30,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 17:55:30,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 17:55:30,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 17:55:35,183 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:35,183 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:55:35,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1351143760] [2024-10-11 17:55:35,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1351143760] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:55:35,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:55:35,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-10-11 17:55:35,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193564296] [2024-10-11 17:55:35,184 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:55:35,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 17:55:35,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:55:35,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 17:55:35,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=201, Unknown=1, NotChecked=0, Total=240 [2024-10-11 17:55:35,185 INFO L87 Difference]: Start difference. First operand 83 states and 94 transitions. Second operand has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:36,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:36,333 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2024-10-11 17:55:36,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 17:55:36,334 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-11 17:55:36,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:36,335 INFO L225 Difference]: With dead ends: 92 [2024-10-11 17:55:36,335 INFO L226 Difference]: Without dead ends: 92 [2024-10-11 17:55:36,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=90, Invalid=289, Unknown=1, NotChecked=0, Total=380 [2024-10-11 17:55:36,336 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 108 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:36,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 295 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 17:55:36,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-11 17:55:36,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 82. [2024-10-11 17:55:36,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 60 states have (on average 1.55) internal successors, (93), 81 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:36,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2024-10-11 17:55:36,339 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 16 [2024-10-11 17:55:36,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:36,339 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2024-10-11 17:55:36,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 16 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:36,339 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2024-10-11 17:55:36,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 17:55:36,340 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:36,340 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:36,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-11 17:55:36,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:55:36,540 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 17:55:36,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:36,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1270736974, now seen corresponding path program 1 times [2024-10-11 17:55:36,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:55:36,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1817772563] [2024-10-11 17:55:36,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:36,541 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:55:36,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:55:36,544 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:55:36,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-11 17:55:36,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:36,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 17:55:36,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:55:36,693 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-11 17:55:36,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-11 17:55:36,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:36,737 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:55:36,738 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:55:36,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1817772563] [2024-10-11 17:55:36,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1817772563] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:36,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:36,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:55:36,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658847426] [2024-10-11 17:55:36,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:36,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:55:36,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:55:36,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:55:36,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:55:36,739 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:37,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:37,043 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2024-10-11 17:55:37,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:55:37,044 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-11 17:55:37,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:37,044 INFO L225 Difference]: With dead ends: 94 [2024-10-11 17:55:37,044 INFO L226 Difference]: Without dead ends: 94 [2024-10-11 17:55:37,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:55:37,045 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 43 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:37,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 94 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 17:55:37,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-11 17:55:37,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 85. [2024-10-11 17:55:37,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 63 states have (on average 1.507936507936508) internal successors, (95), 84 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:37,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2024-10-11 17:55:37,049 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 17 [2024-10-11 17:55:37,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:37,050 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2024-10-11 17:55:37,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:37,050 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2024-10-11 17:55:37,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 17:55:37,050 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:37,051 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:37,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-10-11 17:55:37,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:55:37,252 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 17:55:37,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:37,253 INFO L85 PathProgramCache]: Analyzing trace with hash -738140412, now seen corresponding path program 1 times [2024-10-11 17:55:37,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:55:37,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1938714592] [2024-10-11 17:55:37,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:37,253 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:55:37,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:55:37,256 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:55:37,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-11 17:55:37,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:37,354 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 17:55:37,356 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:55:37,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 17:55:37,378 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 17:55:37,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-11 17:55:37,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 17:55:37,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-10-11 17:55:37,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2024-10-11 17:55:37,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:37,474 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:55:37,474 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:55:37,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1938714592] [2024-10-11 17:55:37,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1938714592] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:37,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:37,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:55:37,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608468646] [2024-10-11 17:55:37,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:37,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:55:37,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:55:37,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:55:37,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:55:37,475 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:37,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:37,662 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2024-10-11 17:55:37,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:55:37,663 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-10-11 17:55:37,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:37,663 INFO L225 Difference]: With dead ends: 95 [2024-10-11 17:55:37,663 INFO L226 Difference]: Without dead ends: 95 [2024-10-11 17:55:37,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:55:37,664 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 86 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:37,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 78 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:55:37,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-11 17:55:37,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 86. [2024-10-11 17:55:37,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 64 states have (on average 1.5) internal successors, (96), 85 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:37,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2024-10-11 17:55:37,667 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 18 [2024-10-11 17:55:37,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:37,667 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2024-10-11 17:55:37,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:37,667 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2024-10-11 17:55:37,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 17:55:37,668 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:37,668 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:37,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-10-11 17:55:37,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:55:37,871 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 17:55:37,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:37,872 INFO L85 PathProgramCache]: Analyzing trace with hash -738140411, now seen corresponding path program 1 times [2024-10-11 17:55:37,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:55:37,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1889805541] [2024-10-11 17:55:37,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:37,872 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:55:37,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:55:37,873 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:55:37,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-11 17:55:37,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:55:37,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 17:55:37,957 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:55:38,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:55:38,002 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:55:38,002 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:55:38,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1889805541] [2024-10-11 17:55:38,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1889805541] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:55:38,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:55:38,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:55:38,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568015975] [2024-10-11 17:55:38,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:55:38,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:55:38,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:55:38,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:55:38,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:55:38,003 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:38,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:55:38,074 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2024-10-11 17:55:38,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:55:38,074 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-10-11 17:55:38,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:55:38,074 INFO L225 Difference]: With dead ends: 80 [2024-10-11 17:55:38,074 INFO L226 Difference]: Without dead ends: 80 [2024-10-11 17:55:38,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:55:38,075 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 77 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:55:38,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 30 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:55:38,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-11 17:55:38,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2024-10-11 17:55:38,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 60 states have (on average 1.35) internal successors, (81), 75 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:38,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2024-10-11 17:55:38,077 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 18 [2024-10-11 17:55:38,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:55:38,078 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2024-10-11 17:55:38,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:55:38,078 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2024-10-11 17:55:38,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 17:55:38,078 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:55:38,079 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:38,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-10-11 17:55:38,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:55:38,279 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-10-11 17:55:38,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:55:38,280 INFO L85 PathProgramCache]: Analyzing trace with hash 293159117, now seen corresponding path program 1 times [2024-10-11 17:55:38,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:55:38,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [949774270] [2024-10-11 17:55:38,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:55:38,280 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:55:38,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:55:38,283 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 17:55:38,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-10-11 17:55:38,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:55:38,410 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 17:55:38,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 17:55:38,499 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-11 17:55:38,499 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 17:55:38,500 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK (43 of 44 remaining) [2024-10-11 17:55:38,501 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 44 remaining) [2024-10-11 17:55:38,501 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 44 remaining) [2024-10-11 17:55:38,501 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 44 remaining) [2024-10-11 17:55:38,501 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 44 remaining) [2024-10-11 17:55:38,501 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 44 remaining) [2024-10-11 17:55:38,502 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 44 remaining) [2024-10-11 17:55:38,502 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 44 remaining) [2024-10-11 17:55:38,502 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 44 remaining) [2024-10-11 17:55:38,502 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 44 remaining) [2024-10-11 17:55:38,502 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 44 remaining) [2024-10-11 17:55:38,502 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 44 remaining) [2024-10-11 17:55:38,502 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 44 remaining) [2024-10-11 17:55:38,502 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 44 remaining) [2024-10-11 17:55:38,502 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 44 remaining) [2024-10-11 17:55:38,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 44 remaining) [2024-10-11 17:55:38,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 44 remaining) [2024-10-11 17:55:38,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 44 remaining) [2024-10-11 17:55:38,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 44 remaining) [2024-10-11 17:55:38,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (24 of 44 remaining) [2024-10-11 17:55:38,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE (23 of 44 remaining) [2024-10-11 17:55:38,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE (22 of 44 remaining) [2024-10-11 17:55:38,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 44 remaining) [2024-10-11 17:55:38,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 44 remaining) [2024-10-11 17:55:38,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 44 remaining) [2024-10-11 17:55:38,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 44 remaining) [2024-10-11 17:55:38,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 44 remaining) [2024-10-11 17:55:38,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 44 remaining) [2024-10-11 17:55:38,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE (15 of 44 remaining) [2024-10-11 17:55:38,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE (14 of 44 remaining) [2024-10-11 17:55:38,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE (13 of 44 remaining) [2024-10-11 17:55:38,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 44 remaining) [2024-10-11 17:55:38,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 44 remaining) [2024-10-11 17:55:38,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 44 remaining) [2024-10-11 17:55:38,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 44 remaining) [2024-10-11 17:55:38,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 44 remaining) [2024-10-11 17:55:38,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 44 remaining) [2024-10-11 17:55:38,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 44 remaining) [2024-10-11 17:55:38,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 44 remaining) [2024-10-11 17:55:38,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE (4 of 44 remaining) [2024-10-11 17:55:38,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE (3 of 44 remaining) [2024-10-11 17:55:38,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE (2 of 44 remaining) [2024-10-11 17:55:38,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 44 remaining) [2024-10-11 17:55:38,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 44 remaining) [2024-10-11 17:55:38,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-10-11 17:55:38,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:55:38,708 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:55:38,733 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 17:55:38,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 05:55:38 BoogieIcfgContainer [2024-10-11 17:55:38,736 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 17:55:38,737 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 17:55:38,737 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 17:55:38,737 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 17:55:38,737 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:55:20" (3/4) ... [2024-10-11 17:55:38,738 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 17:55:38,739 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 17:55:38,740 INFO L158 Benchmark]: Toolchain (without parser) took 19852.41ms. Allocated memory was 60.8MB in the beginning and 117.4MB in the end (delta: 56.6MB). Free memory was 38.2MB in the beginning and 51.2MB in the end (delta: -13.0MB). Peak memory consumption was 41.7MB. Max. memory is 16.1GB. [2024-10-11 17:55:38,740 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 60.8MB. Free memory was 35.6MB in the beginning and 35.5MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:55:38,740 INFO L158 Benchmark]: CACSL2BoogieTranslator took 549.12ms. Allocated memory was 60.8MB in the beginning and 77.6MB in the end (delta: 16.8MB). Free memory was 38.0MB in the beginning and 52.1MB in the end (delta: -14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 17:55:38,740 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.61ms. Allocated memory is still 77.6MB. Free memory was 51.8MB in the beginning and 49.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:55:38,741 INFO L158 Benchmark]: Boogie Preprocessor took 67.40ms. Allocated memory is still 77.6MB. Free memory was 49.9MB in the beginning and 46.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 17:55:38,741 INFO L158 Benchmark]: RCFGBuilder took 802.25ms. Allocated memory is still 77.6MB. Free memory was 46.8MB in the beginning and 38.1MB in the end (delta: 8.7MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2024-10-11 17:55:38,741 INFO L158 Benchmark]: TraceAbstraction took 18368.13ms. Allocated memory was 77.6MB in the beginning and 117.4MB in the end (delta: 39.8MB). Free memory was 37.6MB in the beginning and 51.2MB in the end (delta: -13.6MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. [2024-10-11 17:55:38,741 INFO L158 Benchmark]: Witness Printer took 2.67ms. Allocated memory is still 117.4MB. Free memory is still 51.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:55:38,742 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 60.8MB. Free memory was 35.6MB in the beginning and 35.5MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 549.12ms. Allocated memory was 60.8MB in the beginning and 77.6MB in the end (delta: 16.8MB). Free memory was 38.0MB in the beginning and 52.1MB in the end (delta: -14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.61ms. Allocated memory is still 77.6MB. Free memory was 51.8MB in the beginning and 49.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.40ms. Allocated memory is still 77.6MB. Free memory was 49.9MB in the beginning and 46.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 802.25ms. Allocated memory is still 77.6MB. Free memory was 46.8MB in the beginning and 38.1MB in the end (delta: 8.7MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. * TraceAbstraction took 18368.13ms. Allocated memory was 77.6MB in the beginning and 117.4MB in the end (delta: 39.8MB). Free memory was 37.6MB in the beginning and 51.2MB in the end (delta: -13.6MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. * Witness Printer took 2.67ms. Allocated memory is still 117.4MB. Free memory is still 51.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 539]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 539. Possible FailurePath: [L524] int c = 0; [L541] struct item *list = ((void *)0); [L541] struct item *list = ((void *)0); [L542] int length = 0; VAL [c=0, length=0, list={15:0}] [L544] CALL append(&list) [L531] c++ [L532] struct item *item = malloc(sizeof *item); [L533] EXPR \read(**plist) VAL [c=1] [L533] item->next = *plist [L534] EXPR item->next VAL [c=1] [L534-L536] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L534-L536] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [c=1, item={6:0}, plist={15:0}] [L534-L536] item->data = (item->next) ? item->next->data : malloc(sizeof *item) [L537] *plist = item [L544] RET append(&list) [L545] length++ [L546] COND FALSE !(__VERIFIER_nondet_int() && c < 20) [L547] COND TRUE length > 0 VAL [c=1] [L548] COND FALSE !(length < 0) VAL [c=1] [L551] EXPR \read(*list) VAL [c=1] [L551] EXPR list->next [L551] struct item *next = list->next; [L552] EXPR \read(*list) VAL [c=1] [L552] free(list) VAL [c=1, length=1, list={15:0}, next={0:0}] [L552] free(list) VAL [c=1, length=1, list={15:0}, next={0:0}] [L552] free(list) [L553] list = next [L554] length-- [L556] COND FALSE !(length > 0) VAL [c=1, list={15:0}] [L562] return 0; [L541] struct item *list = ((void *)0); [L562] return 0; VAL [\result=0, c=1] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 549]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 549]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 549]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 558]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 558]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 558]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 80 locations, 44 error locations. Started 1 CEGAR loops. OverallTime: 18.3s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 914 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 914 mSDsluCounter, 2070 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1450 mSDsCounter, 83 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2114 IncrementalHoareTripleChecker+Invalid, 2197 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 83 mSolverCounterUnsat, 620 mSDtfsCounter, 2114 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 228 GetRequests, 129 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 6.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred in iteration=9, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 135 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 206 NumberOfCodeBlocks, 206 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 199 ConstructedInterpolants, 13 QuantifiedInterpolants, 2363 SizeOfPredicates, 60 NumberOfNonLiveVariables, 1582 ConjunctsInSsa, 172 ConjunctsInUnsatCore, 18 InterpolantComputations, 14 PerfectInterpolantSequences, 4/20 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 17:55:38,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample