./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_3.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/memsafety-bftpd/bftpd_3.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 6826aeecba49275836b6b398765a757158a4e84d2c6569399d77f2320562875e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 18:01:33,240 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 18:01:33,321 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 18:01:33,328 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 18:01:33,329 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 18:01:33,363 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 18:01:33,364 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 18:01:33,364 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 18:01:33,365 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 18:01:33,365 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 18:01:33,366 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 18:01:33,366 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 18:01:33,367 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 18:01:33,367 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 18:01:33,368 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 18:01:33,368 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 18:01:33,369 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 18:01:33,370 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 18:01:33,370 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 18:01:33,370 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 18:01:33,371 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 18:01:33,375 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 18:01:33,375 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 18:01:33,375 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 18:01:33,376 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 18:01:33,376 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 18:01:33,376 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 18:01:33,377 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 18:01:33,377 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 18:01:33,377 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 18:01:33,378 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 18:01:33,378 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 18:01:33,378 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 18:01:33,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:01:33,379 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 18:01:33,379 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 18:01:33,379 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 18:01:33,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 18:01:33,380 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 18:01:33,380 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 18:01:33,380 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 18:01:33,381 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 18:01:33,381 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 -> 6826aeecba49275836b6b398765a757158a4e84d2c6569399d77f2320562875e [2024-10-11 18:01:33,652 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 18:01:33,682 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 18:01:33,686 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 18:01:33,687 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 18:01:33,687 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 18:01:33,689 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_3.i [2024-10-11 18:01:35,175 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 18:01:35,441 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 18:01:35,441 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_3.i [2024-10-11 18:01:35,456 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5b754bb8c/9eecc32ddc834d839f49e8ec13f964a4/FLAGf76c8ef27 [2024-10-11 18:01:35,472 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5b754bb8c/9eecc32ddc834d839f49e8ec13f964a4 [2024-10-11 18:01:35,475 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 18:01:35,476 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 18:01:35,479 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 18:01:35,479 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 18:01:35,485 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 18:01:35,486 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:01:35" (1/1) ... [2024-10-11 18:01:35,487 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52e9931 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:35, skipping insertion in model container [2024-10-11 18:01:35,487 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:01:35" (1/1) ... [2024-10-11 18:01:35,539 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 18:01:35,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:01:35,964 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 18:01:36,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:01:36,069 INFO L204 MainTranslator]: Completed translation [2024-10-11 18:01:36,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:36 WrapperNode [2024-10-11 18:01:36,070 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 18:01:36,072 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 18:01:36,072 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 18:01:36,072 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 18:01:36,080 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:36" (1/1) ... [2024-10-11 18:01:36,096 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:36" (1/1) ... [2024-10-11 18:01:36,131 INFO L138 Inliner]: procedures = 168, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 95 [2024-10-11 18:01:36,131 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 18:01:36,132 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 18:01:36,136 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 18:01:36,136 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 18:01:36,148 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:36" (1/1) ... [2024-10-11 18:01:36,149 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:36" (1/1) ... [2024-10-11 18:01:36,152 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:36" (1/1) ... [2024-10-11 18:01:36,182 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [6, 9, 9]. 38 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [6, 6, 9]. The 0 writes are split as follows [0, 0, 0]. [2024-10-11 18:01:36,182 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:36" (1/1) ... [2024-10-11 18:01:36,183 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:36" (1/1) ... [2024-10-11 18:01:36,195 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:36" (1/1) ... [2024-10-11 18:01:36,202 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:36" (1/1) ... [2024-10-11 18:01:36,204 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:36" (1/1) ... [2024-10-11 18:01:36,209 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:36" (1/1) ... [2024-10-11 18:01:36,211 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 18:01:36,212 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 18:01:36,216 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 18:01:36,216 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 18:01:36,217 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:36" (1/1) ... [2024-10-11 18:01:36,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:01:36,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:01:36,252 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 18:01:36,254 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 18:01:36,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 18:01:36,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 18:01:36,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 18:01:36,307 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2024-10-11 18:01:36,307 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2024-10-11 18:01:36,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 18:01:36,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 18:01:36,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 18:01:36,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 18:01:36,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 18:01:36,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 18:01:36,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 18:01:36,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 18:01:36,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 18:01:36,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 18:01:36,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 18:01:36,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 18:01:36,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 18:01:36,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 18:01:36,439 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 18:01:36,442 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 18:01:36,736 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-10-11 18:01:36,738 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 18:01:36,776 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 18:01:36,777 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 18:01:36,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:01:36 BoogieIcfgContainer [2024-10-11 18:01:36,777 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 18:01:36,780 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 18:01:36,780 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 18:01:36,783 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 18:01:36,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:01:35" (1/3) ... [2024-10-11 18:01:36,785 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@166264f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:01:36, skipping insertion in model container [2024-10-11 18:01:36,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:01:36" (2/3) ... [2024-10-11 18:01:36,785 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@166264f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:01:36, skipping insertion in model container [2024-10-11 18:01:36,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:01:36" (3/3) ... [2024-10-11 18:01:36,787 INFO L112 eAbstractionObserver]: Analyzing ICFG bftpd_3.i [2024-10-11 18:01:36,808 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 18:01:36,809 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2024-10-11 18:01:36,865 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 18:01:36,872 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;@6e9b3e74, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 18:01:36,873 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-10-11 18:01:36,877 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 54 states have internal predecessors, (62), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:01:36,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 18:01:36,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:36,886 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 18:01:36,887 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 18:01:36,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:36,893 INFO L85 PathProgramCache]: Analyzing trace with hash 131378568, now seen corresponding path program 1 times [2024-10-11 18:01:36,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:36,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773806722] [2024-10-11 18:01:36,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:36,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:37,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:37,271 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 18:01:37,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:37,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773806722] [2024-10-11 18:01:37,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773806722] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:01:37,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:01:37,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:01:37,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035802363] [2024-10-11 18:01:37,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:01:37,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:01:37,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:37,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:01:37,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:01:37,311 INFO L87 Difference]: Start difference. First operand has 59 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 54 states have internal predecessors, (62), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:37,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:37,477 INFO L93 Difference]: Finished difference Result 117 states and 138 transitions. [2024-10-11 18:01:37,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:01:37,480 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 18:01:37,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:37,493 INFO L225 Difference]: With dead ends: 117 [2024-10-11 18:01:37,494 INFO L226 Difference]: Without dead ends: 114 [2024-10-11 18:01:37,496 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 18:01:37,500 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 143 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:37,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 100 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:01:37,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-11 18:01:37,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 87. [2024-10-11 18:01:37,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 60 states have (on average 1.65) internal successors, (99), 77 states have internal predecessors, (99), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-11 18:01:37,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 117 transitions. [2024-10-11 18:01:37,570 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 117 transitions. Word has length 5 [2024-10-11 18:01:37,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:37,571 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 117 transitions. [2024-10-11 18:01:37,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:37,571 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 117 transitions. [2024-10-11 18:01:37,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 18:01:37,572 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:37,572 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 18:01:37,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 18:01:37,573 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 18:01:37,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:37,574 INFO L85 PathProgramCache]: Analyzing trace with hash 131378569, now seen corresponding path program 1 times [2024-10-11 18:01:37,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:37,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107074966] [2024-10-11 18:01:37,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:37,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:37,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:37,808 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 18:01:37,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:37,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107074966] [2024-10-11 18:01:37,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107074966] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:01:37,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:01:37,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:01:37,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267677495] [2024-10-11 18:01:37,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:01:37,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:01:37,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:37,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:01:37,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:01:37,815 INFO L87 Difference]: Start difference. First operand 87 states and 117 transitions. Second operand has 5 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:37,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:37,983 INFO L93 Difference]: Finished difference Result 186 states and 250 transitions. [2024-10-11 18:01:37,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:01:37,984 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 18:01:37,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:37,988 INFO L225 Difference]: With dead ends: 186 [2024-10-11 18:01:37,988 INFO L226 Difference]: Without dead ends: 186 [2024-10-11 18:01:37,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:01:37,990 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 88 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:37,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 193 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:01:37,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-10-11 18:01:38,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 160. [2024-10-11 18:01:38,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 126 states have (on average 1.6666666666666667) internal successors, (210), 143 states have internal predecessors, (210), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2024-10-11 18:01:38,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 246 transitions. [2024-10-11 18:01:38,025 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 246 transitions. Word has length 5 [2024-10-11 18:01:38,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:38,025 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 246 transitions. [2024-10-11 18:01:38,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:38,026 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 246 transitions. [2024-10-11 18:01:38,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 18:01:38,026 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:38,026 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 18:01:38,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 18:01:38,027 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 18:01:38,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:38,027 INFO L85 PathProgramCache]: Analyzing trace with hash -222231707, now seen corresponding path program 1 times [2024-10-11 18:01:38,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:38,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94230770] [2024-10-11 18:01:38,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:38,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:38,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:38,280 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 18:01:38,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:38,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94230770] [2024-10-11 18:01:38,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94230770] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:01:38,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:01:38,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:01:38,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942806637] [2024-10-11 18:01:38,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:01:38,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:01:38,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:38,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:01:38,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:01:38,289 INFO L87 Difference]: Start difference. First operand 160 states and 246 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:38,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:38,448 INFO L93 Difference]: Finished difference Result 205 states and 295 transitions. [2024-10-11 18:01:38,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:01:38,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-11 18:01:38,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:38,451 INFO L225 Difference]: With dead ends: 205 [2024-10-11 18:01:38,451 INFO L226 Difference]: Without dead ends: 205 [2024-10-11 18:01:38,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:01:38,453 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 79 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:38,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 156 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:01:38,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-10-11 18:01:38,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 163. [2024-10-11 18:01:38,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 129 states have (on average 1.6511627906976745) internal successors, (213), 146 states have internal predecessors, (213), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2024-10-11 18:01:38,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 249 transitions. [2024-10-11 18:01:38,467 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 249 transitions. Word has length 6 [2024-10-11 18:01:38,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:38,468 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 249 transitions. [2024-10-11 18:01:38,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:38,468 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 249 transitions. [2024-10-11 18:01:38,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 18:01:38,469 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:38,469 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:01:38,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 18:01:38,469 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 18:01:38,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:38,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1700751720, now seen corresponding path program 1 times [2024-10-11 18:01:38,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:38,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348408771] [2024-10-11 18:01:38,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:38,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:38,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:38,655 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 18:01:38,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:38,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348408771] [2024-10-11 18:01:38,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348408771] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:01:38,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:01:38,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:01:38,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531227764] [2024-10-11 18:01:38,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:01:38,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:01:38,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:38,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:01:38,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:01:38,657 INFO L87 Difference]: Start difference. First operand 163 states and 249 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:38,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:38,840 INFO L93 Difference]: Finished difference Result 188 states and 251 transitions. [2024-10-11 18:01:38,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:01:38,841 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 18:01:38,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:38,843 INFO L225 Difference]: With dead ends: 188 [2024-10-11 18:01:38,843 INFO L226 Difference]: Without dead ends: 188 [2024-10-11 18:01:38,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:01:38,845 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 69 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:38,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 187 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:01:38,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-10-11 18:01:38,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 163. [2024-10-11 18:01:38,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 129 states have (on average 1.6356589147286822) internal successors, (211), 146 states have internal predecessors, (211), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2024-10-11 18:01:38,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 247 transitions. [2024-10-11 18:01:38,872 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 247 transitions. Word has length 7 [2024-10-11 18:01:38,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:38,873 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 247 transitions. [2024-10-11 18:01:38,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:38,873 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 247 transitions. [2024-10-11 18:01:38,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 18:01:38,873 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:38,874 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:01:38,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 18:01:38,874 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 18:01:38,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:38,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1183695815, now seen corresponding path program 1 times [2024-10-11 18:01:38,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:38,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497720384] [2024-10-11 18:01:38,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:38,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:38,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:38,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 18:01:38,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:38,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497720384] [2024-10-11 18:01:38,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497720384] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:01:38,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:01:38,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:01:38,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228786976] [2024-10-11 18:01:38,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:01:38,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:01:38,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:38,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:01:38,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:01:38,956 INFO L87 Difference]: Start difference. First operand 163 states and 247 transitions. Second operand has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:39,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:39,064 INFO L93 Difference]: Finished difference Result 245 states and 337 transitions. [2024-10-11 18:01:39,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:01:39,065 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-11 18:01:39,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:39,067 INFO L225 Difference]: With dead ends: 245 [2024-10-11 18:01:39,067 INFO L226 Difference]: Without dead ends: 245 [2024-10-11 18:01:39,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:01:39,068 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 131 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:39,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 174 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:01:39,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-10-11 18:01:39,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 196. [2024-10-11 18:01:39,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 160 states have (on average 1.60625) internal successors, (257), 178 states have internal predecessors, (257), 10 states have call successors, (10), 7 states have call predecessors, (10), 8 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2024-10-11 18:01:39,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 293 transitions. [2024-10-11 18:01:39,085 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 293 transitions. Word has length 8 [2024-10-11 18:01:39,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:39,087 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 293 transitions. [2024-10-11 18:01:39,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:39,088 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 293 transitions. [2024-10-11 18:01:39,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 18:01:39,088 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:39,088 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:01:39,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 18:01:39,089 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 18:01:39,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:39,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1960135350, now seen corresponding path program 1 times [2024-10-11 18:01:39,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:39,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533943849] [2024-10-11 18:01:39,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:39,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:39,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:39,189 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 18:01:39,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:39,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533943849] [2024-10-11 18:01:39,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533943849] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:01:39,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:01:39,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:01:39,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321895073] [2024-10-11 18:01:39,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:01:39,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:01:39,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:39,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:01:39,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:01:39,195 INFO L87 Difference]: Start difference. First operand 196 states and 293 transitions. Second operand has 5 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:39,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:39,304 INFO L93 Difference]: Finished difference Result 244 states and 316 transitions. [2024-10-11 18:01:39,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:01:39,305 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-11 18:01:39,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:39,307 INFO L225 Difference]: With dead ends: 244 [2024-10-11 18:01:39,307 INFO L226 Difference]: Without dead ends: 244 [2024-10-11 18:01:39,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:01:39,308 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 138 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:39,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 204 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:01:39,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-10-11 18:01:39,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 210. [2024-10-11 18:01:39,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 173 states have (on average 1.606936416184971) internal successors, (278), 192 states have internal predecessors, (278), 10 states have call successors, (10), 7 states have call predecessors, (10), 9 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2024-10-11 18:01:39,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 314 transitions. [2024-10-11 18:01:39,330 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 314 transitions. Word has length 9 [2024-10-11 18:01:39,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:39,330 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 314 transitions. [2024-10-11 18:01:39,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:39,331 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 314 transitions. [2024-10-11 18:01:39,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 18:01:39,331 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:39,331 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:01:39,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 18:01:39,332 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 18:01:39,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:39,333 INFO L85 PathProgramCache]: Analyzing trace with hash -519071088, now seen corresponding path program 1 times [2024-10-11 18:01:39,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:39,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847112619] [2024-10-11 18:01:39,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:39,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:39,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:39,478 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:01:39,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:39,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847112619] [2024-10-11 18:01:39,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847112619] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:39,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631030188] [2024-10-11 18:01:39,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:39,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:39,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:01:39,481 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 18:01:39,483 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 18:01:39,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:39,551 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 18:01:39,555 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:01:39,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:01:39,719 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:01:39,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:01:39,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631030188] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:01:39,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:01:39,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 11 [2024-10-11 18:01:39,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144387209] [2024-10-11 18:01:39,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:01:39,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 18:01:39,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:39,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 18:01:39,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-10-11 18:01:39,838 INFO L87 Difference]: Start difference. First operand 210 states and 314 transitions. Second operand has 13 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:40,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:40,048 INFO L93 Difference]: Finished difference Result 236 states and 313 transitions. [2024-10-11 18:01:40,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:01:40,049 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 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 18:01:40,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:40,050 INFO L225 Difference]: With dead ends: 236 [2024-10-11 18:01:40,050 INFO L226 Difference]: Without dead ends: 236 [2024-10-11 18:01:40,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-10-11 18:01:40,051 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 155 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:40,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 426 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:01:40,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-10-11 18:01:40,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 213. [2024-10-11 18:01:40,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 176 states have (on average 1.5454545454545454) internal successors, (272), 195 states have internal predecessors, (272), 10 states have call successors, (10), 7 states have call predecessors, (10), 9 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2024-10-11 18:01:40,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 308 transitions. [2024-10-11 18:01:40,065 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 308 transitions. Word has length 13 [2024-10-11 18:01:40,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:40,066 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 308 transitions. [2024-10-11 18:01:40,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:40,066 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 308 transitions. [2024-10-11 18:01:40,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 18:01:40,067 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:40,067 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:01:40,085 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 18:01:40,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:40,268 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 18:01:40,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:40,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1088665406, now seen corresponding path program 1 times [2024-10-11 18:01:40,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:40,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843750219] [2024-10-11 18:01:40,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:40,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:40,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:40,443 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:01:40,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:40,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843750219] [2024-10-11 18:01:40,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843750219] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:40,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004457249] [2024-10-11 18:01:40,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:40,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:40,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:01:40,446 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 18:01:40,447 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 18:01:40,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:40,516 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 18:01:40,517 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:01:40,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:01:40,677 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:01:40,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:01:40,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004457249] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:01:40,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:01:40,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2024-10-11 18:01:40,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815887092] [2024-10-11 18:01:40,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:01:40,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 18:01:40,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:40,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 18:01:40,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-10-11 18:01:40,757 INFO L87 Difference]: Start difference. First operand 213 states and 308 transitions. Second operand has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:40,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:40,994 INFO L93 Difference]: Finished difference Result 256 states and 353 transitions. [2024-10-11 18:01:40,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:01:40,995 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-11 18:01:40,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:40,999 INFO L225 Difference]: With dead ends: 256 [2024-10-11 18:01:40,999 INFO L226 Difference]: Without dead ends: 256 [2024-10-11 18:01:41,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2024-10-11 18:01:41,000 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 102 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:41,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 309 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:01:41,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-10-11 18:01:41,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 221. [2024-10-11 18:01:41,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 184 states have (on average 1.5380434782608696) internal successors, (283), 203 states have internal predecessors, (283), 10 states have call successors, (10), 7 states have call predecessors, (10), 9 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2024-10-11 18:01:41,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 319 transitions. [2024-10-11 18:01:41,013 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 319 transitions. Word has length 14 [2024-10-11 18:01:41,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:41,014 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 319 transitions. [2024-10-11 18:01:41,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:41,014 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 319 transitions. [2024-10-11 18:01:41,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 18:01:41,014 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:41,015 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:01:41,031 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 18:01:41,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:41,216 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 18:01:41,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:41,217 INFO L85 PathProgramCache]: Analyzing trace with hash -611110737, now seen corresponding path program 1 times [2024-10-11 18:01:41,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:41,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945633970] [2024-10-11 18:01:41,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:41,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:41,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:41,435 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:01:41,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:41,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945633970] [2024-10-11 18:01:41,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945633970] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:41,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419428630] [2024-10-11 18:01:41,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:41,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:41,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:01:41,438 INFO L229 MonitoredProcess]: Starting monitored process 4 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 18:01:41,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 18:01:41,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:41,510 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 18:01:41,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:01:41,710 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:01:41,710 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:01:41,835 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:01:41,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419428630] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:01:41,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:01:41,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2024-10-11 18:01:41,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808147061] [2024-10-11 18:01:41,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:01:41,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 18:01:41,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:41,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 18:01:41,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-10-11 18:01:41,837 INFO L87 Difference]: Start difference. First operand 221 states and 319 transitions. Second operand has 15 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:42,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:42,362 INFO L93 Difference]: Finished difference Result 355 states and 471 transitions. [2024-10-11 18:01:42,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 18:01:42,362 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 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 18:01:42,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:42,364 INFO L225 Difference]: With dead ends: 355 [2024-10-11 18:01:42,364 INFO L226 Difference]: Without dead ends: 355 [2024-10-11 18:01:42,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2024-10-11 18:01:42,365 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 254 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:42,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 640 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:01:42,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2024-10-11 18:01:42,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 292. [2024-10-11 18:01:42,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 251 states have (on average 1.5577689243027888) internal successors, (391), 272 states have internal predecessors, (391), 11 states have call successors, (11), 8 states have call predecessors, (11), 12 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) [2024-10-11 18:01:42,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 434 transitions. [2024-10-11 18:01:42,381 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 434 transitions. Word has length 15 [2024-10-11 18:01:42,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:42,381 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 434 transitions. [2024-10-11 18:01:42,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:42,382 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 434 transitions. [2024-10-11 18:01:42,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 18:01:42,383 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:42,383 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:01:42,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 18:01:42,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:42,588 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting parse_inputErr10ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 18:01:42,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:42,588 INFO L85 PathProgramCache]: Analyzing trace with hash -905176023, now seen corresponding path program 1 times [2024-10-11 18:01:42,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:42,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432382550] [2024-10-11 18:01:42,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:42,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:42,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:42,620 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 18:01:42,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:42,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432382550] [2024-10-11 18:01:42,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432382550] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:01:42,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:01:42,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 18:01:42,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923296328] [2024-10-11 18:01:42,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:01:42,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:01:42,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:42,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:01:42,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:01:42,622 INFO L87 Difference]: Start difference. First operand 292 states and 434 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:42,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:42,648 INFO L93 Difference]: Finished difference Result 428 states and 642 transitions. [2024-10-11 18:01:42,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:01:42,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-11 18:01:42,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:42,650 INFO L225 Difference]: With dead ends: 428 [2024-10-11 18:01:42,650 INFO L226 Difference]: Without dead ends: 428 [2024-10-11 18:01:42,651 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 18:01:42,652 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 48 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:42,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 98 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:01:42,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2024-10-11 18:01:42,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 411. [2024-10-11 18:01:42,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 361 states have (on average 1.5650969529085872) internal successors, (565), 384 states have internal predecessors, (565), 15 states have call successors, (15), 11 states have call predecessors, (15), 17 states have return successors, (54), 15 states have call predecessors, (54), 15 states have call successors, (54) [2024-10-11 18:01:42,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 634 transitions. [2024-10-11 18:01:42,675 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 634 transitions. Word has length 16 [2024-10-11 18:01:42,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:42,675 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 634 transitions. [2024-10-11 18:01:42,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:42,675 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 634 transitions. [2024-10-11 18:01:42,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 18:01:42,676 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:42,676 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:01:42,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 18:01:42,677 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting parse_inputErr13ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 18:01:42,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:42,677 INFO L85 PathProgramCache]: Analyzing trace with hash -905175767, now seen corresponding path program 1 times [2024-10-11 18:01:42,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:42,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442503349] [2024-10-11 18:01:42,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:42,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:42,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:42,707 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 18:01:42,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:42,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442503349] [2024-10-11 18:01:42,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442503349] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:01:42,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:01:42,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:01:42,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649401206] [2024-10-11 18:01:42,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:01:42,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:01:42,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:42,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:01:42,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:01:42,708 INFO L87 Difference]: Start difference. First operand 411 states and 634 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:42,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:42,721 INFO L93 Difference]: Finished difference Result 373 states and 568 transitions. [2024-10-11 18:01:42,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:01:42,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-11 18:01:42,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:42,724 INFO L225 Difference]: With dead ends: 373 [2024-10-11 18:01:42,724 INFO L226 Difference]: Without dead ends: 373 [2024-10-11 18:01:42,724 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 18:01:42,725 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:42,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:01:42,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2024-10-11 18:01:42,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2024-10-11 18:01:42,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 329 states have (on average 1.5167173252279635) internal successors, (499), 346 states have internal predecessors, (499), 15 states have call successors, (15), 11 states have call predecessors, (15), 17 states have return successors, (54), 15 states have call predecessors, (54), 15 states have call successors, (54) [2024-10-11 18:01:42,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 568 transitions. [2024-10-11 18:01:42,740 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 568 transitions. Word has length 16 [2024-10-11 18:01:42,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:42,740 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 568 transitions. [2024-10-11 18:01:42,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:42,741 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 568 transitions. [2024-10-11 18:01:42,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 18:01:42,741 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:42,741 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 18:01:42,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 18:01:42,742 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting parse_inputErr11ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 18:01:42,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:42,743 INFO L85 PathProgramCache]: Analyzing trace with hash 2004314431, now seen corresponding path program 1 times [2024-10-11 18:01:42,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:42,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629860755] [2024-10-11 18:01:42,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:42,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:42,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:42,821 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 18:01:42,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:42,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629860755] [2024-10-11 18:01:42,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629860755] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:01:42,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:01:42,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 18:01:42,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413619856] [2024-10-11 18:01:42,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:01:42,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:01:42,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:42,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:01:42,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:01:42,823 INFO L87 Difference]: Start difference. First operand 373 states and 568 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:42,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:42,858 INFO L93 Difference]: Finished difference Result 439 states and 648 transitions. [2024-10-11 18:01:42,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:01:42,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-11 18:01:42,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:42,861 INFO L225 Difference]: With dead ends: 439 [2024-10-11 18:01:42,861 INFO L226 Difference]: Without dead ends: 439 [2024-10-11 18:01:42,861 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 18:01:42,862 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 31 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:42,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 83 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:01:42,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2024-10-11 18:01:42,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 422. [2024-10-11 18:01:42,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 374 states have (on average 1.5106951871657754) internal successors, (565), 393 states have internal predecessors, (565), 16 states have call successors, (16), 12 states have call predecessors, (16), 20 states have return successors, (57), 16 states have call predecessors, (57), 16 states have call successors, (57) [2024-10-11 18:01:42,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 638 transitions. [2024-10-11 18:01:42,879 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 638 transitions. Word has length 17 [2024-10-11 18:01:42,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:42,881 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 638 transitions. [2024-10-11 18:01:42,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:01:42,881 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 638 transitions. [2024-10-11 18:01:42,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 18:01:42,882 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:42,882 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:01:42,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 18:01:42,883 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 18:01:42,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:42,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1348043702, now seen corresponding path program 1 times [2024-10-11 18:01:42,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:42,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016965271] [2024-10-11 18:01:42,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:42,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:42,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:42,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:01:42,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:42,936 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:01:42,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:42,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016965271] [2024-10-11 18:01:42,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016965271] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:01:42,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:01:42,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:01:42,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769983542] [2024-10-11 18:01:42,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:01:42,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:01:42,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:42,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:01:42,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:01:42,939 INFO L87 Difference]: Start difference. First operand 422 states and 638 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:01:42,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:42,999 INFO L93 Difference]: Finished difference Result 300 states and 427 transitions. [2024-10-11 18:01:43,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:01:43,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-10-11 18:01:43,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:43,001 INFO L225 Difference]: With dead ends: 300 [2024-10-11 18:01:43,002 INFO L226 Difference]: Without dead ends: 300 [2024-10-11 18:01:43,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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 18:01:43,002 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 35 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:43,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 54 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:01:43,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-10-11 18:01:43,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 294. [2024-10-11 18:01:43,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 256 states have (on average 1.4765625) internal successors, (378), 274 states have internal predecessors, (378), 11 states have call successors, (11), 8 states have call predecessors, (11), 15 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) [2024-10-11 18:01:43,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 421 transitions. [2024-10-11 18:01:43,010 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 421 transitions. Word has length 23 [2024-10-11 18:01:43,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:43,011 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 421 transitions. [2024-10-11 18:01:43,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:01:43,011 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 421 transitions. [2024-10-11 18:01:43,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 18:01:43,012 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:43,012 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:01:43,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 18:01:43,012 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 18:01:43,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:43,013 INFO L85 PathProgramCache]: Analyzing trace with hash -780593392, now seen corresponding path program 1 times [2024-10-11 18:01:43,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:43,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178348497] [2024-10-11 18:01:43,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:43,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:43,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:43,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:01:43,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:43,164 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:01:43,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:43,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178348497] [2024-10-11 18:01:43,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178348497] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:01:43,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:01:43,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:01:43,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165781075] [2024-10-11 18:01:43,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:01:43,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 18:01:43,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:43,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 18:01:43,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:01:43,167 INFO L87 Difference]: Start difference. First operand 294 states and 421 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:01:43,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:43,331 INFO L93 Difference]: Finished difference Result 313 states and 435 transitions. [2024-10-11 18:01:43,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 18:01:43,331 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-10-11 18:01:43,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:43,333 INFO L225 Difference]: With dead ends: 313 [2024-10-11 18:01:43,333 INFO L226 Difference]: Without dead ends: 313 [2024-10-11 18:01:43,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:01:43,334 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 102 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:43,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 127 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:01:43,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-10-11 18:01:43,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 294. [2024-10-11 18:01:43,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 256 states have (on average 1.46484375) internal successors, (375), 274 states have internal predecessors, (375), 11 states have call successors, (11), 8 states have call predecessors, (11), 15 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) [2024-10-11 18:01:43,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 418 transitions. [2024-10-11 18:01:43,342 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 418 transitions. Word has length 25 [2024-10-11 18:01:43,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:43,342 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 418 transitions. [2024-10-11 18:01:43,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:01:43,343 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 418 transitions. [2024-10-11 18:01:43,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 18:01:43,344 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:43,344 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:01:43,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 18:01:43,345 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 18:01:43,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:43,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1173620402, now seen corresponding path program 1 times [2024-10-11 18:01:43,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:43,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585040198] [2024-10-11 18:01:43,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:43,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:43,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:43,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:01:43,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:43,623 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:01:43,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:43,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585040198] [2024-10-11 18:01:43,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585040198] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:43,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819695019] [2024-10-11 18:01:43,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:43,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:43,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:01:43,626 INFO L229 MonitoredProcess]: Starting monitored process 5 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 18:01:43,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 18:01:43,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:43,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 18:01:43,700 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:01:43,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:01:43,967 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 18:01:44,043 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:01:44,043 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:01:44,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819695019] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:44,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:01:44,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 13 [2024-10-11 18:01:44,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357107738] [2024-10-11 18:01:44,196 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:01:44,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 18:01:44,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:44,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 18:01:44,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2024-10-11 18:01:44,197 INFO L87 Difference]: Start difference. First operand 294 states and 418 transitions. Second operand has 15 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:01:44,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:44,645 INFO L93 Difference]: Finished difference Result 310 states and 419 transitions. [2024-10-11 18:01:44,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 18:01:44,646 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2024-10-11 18:01:44,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:44,647 INFO L225 Difference]: With dead ends: 310 [2024-10-11 18:01:44,647 INFO L226 Difference]: Without dead ends: 310 [2024-10-11 18:01:44,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=487, Unknown=0, NotChecked=0, Total=650 [2024-10-11 18:01:44,648 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 386 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:44,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 80 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:01:44,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-10-11 18:01:44,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 298. [2024-10-11 18:01:44,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 260 states have (on average 1.4192307692307693) internal successors, (369), 278 states have internal predecessors, (369), 11 states have call successors, (11), 8 states have call predecessors, (11), 15 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) [2024-10-11 18:01:44,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 412 transitions. [2024-10-11 18:01:44,658 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 412 transitions. Word has length 25 [2024-10-11 18:01:44,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:44,658 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 412 transitions. [2024-10-11 18:01:44,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:01:44,658 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 412 transitions. [2024-10-11 18:01:44,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 18:01:44,659 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:44,659 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:01:44,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 18:01:44,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-11 18:01:44,860 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 18:01:44,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:44,861 INFO L85 PathProgramCache]: Analyzing trace with hash -177446873, now seen corresponding path program 1 times [2024-10-11 18:01:44,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:44,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920742897] [2024-10-11 18:01:44,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:44,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:44,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:44,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:01:44,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:45,025 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:01:45,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:45,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920742897] [2024-10-11 18:01:45,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920742897] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:45,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568721912] [2024-10-11 18:01:45,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:45,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:45,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:01:45,028 INFO L229 MonitoredProcess]: Starting monitored process 6 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 18:01:45,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 18:01:45,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:45,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 18:01:45,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:01:45,205 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:01:45,206 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:01:45,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568721912] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:01:45,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:01:45,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2024-10-11 18:01:45,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267520833] [2024-10-11 18:01:45,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:01:45,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:01:45,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:45,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:01:45,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-11 18:01:45,208 INFO L87 Difference]: Start difference. First operand 298 states and 412 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:01:45,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:45,255 INFO L93 Difference]: Finished difference Result 312 states and 422 transitions. [2024-10-11 18:01:45,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:01:45,257 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-10-11 18:01:45,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:45,258 INFO L225 Difference]: With dead ends: 312 [2024-10-11 18:01:45,259 INFO L226 Difference]: Without dead ends: 312 [2024-10-11 18:01:45,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-11 18:01:45,259 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 62 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:45,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 100 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:01:45,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-10-11 18:01:45,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 304. [2024-10-11 18:01:45,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 266 states have (on average 1.4097744360902256) internal successors, (375), 284 states have internal predecessors, (375), 11 states have call successors, (11), 8 states have call predecessors, (11), 15 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) [2024-10-11 18:01:45,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 418 transitions. [2024-10-11 18:01:45,268 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 418 transitions. Word has length 26 [2024-10-11 18:01:45,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:45,268 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 418 transitions. [2024-10-11 18:01:45,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:01:45,270 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 418 transitions. [2024-10-11 18:01:45,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 18:01:45,270 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:45,271 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:01:45,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 18:01:45,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-11 18:01:45,472 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 18:01:45,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:45,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1727191021, now seen corresponding path program 1 times [2024-10-11 18:01:45,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:45,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206674250] [2024-10-11 18:01:45,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:45,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:45,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:45,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:01:45,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:46,021 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:01:46,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:46,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206674250] [2024-10-11 18:01:46,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206674250] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:46,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048501876] [2024-10-11 18:01:46,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:46,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:46,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:01:46,024 INFO L229 MonitoredProcess]: Starting monitored process 7 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 18:01:46,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 18:01:46,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:46,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 18:01:46,097 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:01:46,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:01:46,384 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 18:01:46,497 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:01:46,497 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:01:46,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048501876] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:46,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:01:46,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 17 [2024-10-11 18:01:46,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878342911] [2024-10-11 18:01:46,638 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:01:46,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 18:01:46,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:46,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 18:01:46,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2024-10-11 18:01:46,639 INFO L87 Difference]: Start difference. First operand 304 states and 418 transitions. Second operand has 19 states, 16 states have (on average 3.0) internal successors, (48), 15 states have internal predecessors, (48), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:01:47,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:47,208 INFO L93 Difference]: Finished difference Result 313 states and 418 transitions. [2024-10-11 18:01:47,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 18:01:47,208 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 3.0) internal successors, (48), 15 states have internal predecessors, (48), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2024-10-11 18:01:47,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:47,210 INFO L225 Difference]: With dead ends: 313 [2024-10-11 18:01:47,210 INFO L226 Difference]: Without dead ends: 313 [2024-10-11 18:01:47,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=188, Invalid=624, Unknown=0, NotChecked=0, Total=812 [2024-10-11 18:01:47,211 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 268 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:47,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 133 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:01:47,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-10-11 18:01:47,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 305. [2024-10-11 18:01:47,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 267 states have (on average 1.3895131086142323) internal successors, (371), 285 states have internal predecessors, (371), 11 states have call successors, (11), 8 states have call predecessors, (11), 15 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) [2024-10-11 18:01:47,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 414 transitions. [2024-10-11 18:01:47,219 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 414 transitions. Word has length 27 [2024-10-11 18:01:47,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:47,220 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 414 transitions. [2024-10-11 18:01:47,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 3.0) internal successors, (48), 15 states have internal predecessors, (48), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:01:47,220 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 414 transitions. [2024-10-11 18:01:47,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 18:01:47,221 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:47,221 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:01:47,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 18:01:47,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-11 18:01:47,425 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 18:01:47,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:47,426 INFO L85 PathProgramCache]: Analyzing trace with hash 2003314146, now seen corresponding path program 1 times [2024-10-11 18:01:47,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:47,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610711346] [2024-10-11 18:01:47,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:47,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:47,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:47,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:01:47,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:47,691 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:01:47,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:47,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610711346] [2024-10-11 18:01:47,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610711346] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:47,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946462713] [2024-10-11 18:01:47,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:47,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:47,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:01:47,694 INFO L229 MonitoredProcess]: Starting monitored process 8 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 18:01:47,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 18:01:47,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:47,777 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 18:01:47,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:01:47,862 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-11 18:01:47,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-11 18:01:47,911 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:01:47,912 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:01:47,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946462713] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:47,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:01:47,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2024-10-11 18:01:47,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537832821] [2024-10-11 18:01:47,964 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:01:47,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 18:01:47,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:47,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 18:01:47,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-10-11 18:01:47,965 INFO L87 Difference]: Start difference. First operand 305 states and 414 transitions. Second operand has 12 states, 10 states have (on average 3.9) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:01:48,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:48,469 INFO L93 Difference]: Finished difference Result 419 states and 527 transitions. [2024-10-11 18:01:48,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 18:01:48,470 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.9) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2024-10-11 18:01:48,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:48,472 INFO L225 Difference]: With dead ends: 419 [2024-10-11 18:01:48,472 INFO L226 Difference]: Without dead ends: 419 [2024-10-11 18:01:48,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2024-10-11 18:01:48,474 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 323 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:48,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 150 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:01:48,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2024-10-11 18:01:48,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 378. [2024-10-11 18:01:48,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 337 states have (on average 1.3560830860534125) internal successors, (457), 356 states have internal predecessors, (457), 11 states have call successors, (11), 10 states have call predecessors, (11), 18 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2024-10-11 18:01:48,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 499 transitions. [2024-10-11 18:01:48,487 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 499 transitions. Word has length 28 [2024-10-11 18:01:48,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:48,487 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 499 transitions. [2024-10-11 18:01:48,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.9) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:01:48,488 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 499 transitions. [2024-10-11 18:01:48,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 18:01:48,488 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:48,489 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:01:48,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 18:01:48,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 18:01:48,693 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 18:01:48,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:48,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1973196431, now seen corresponding path program 1 times [2024-10-11 18:01:48,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:48,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50035004] [2024-10-11 18:01:48,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:48,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:48,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:48,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:01:48,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:48,938 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:01:48,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:48,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50035004] [2024-10-11 18:01:48,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50035004] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:48,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88131588] [2024-10-11 18:01:48,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:48,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:48,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:01:48,941 INFO L229 MonitoredProcess]: Starting monitored process 9 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 18:01:48,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 18:01:49,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:49,016 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-11 18:01:49,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:01:49,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:01:49,142 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 18:01:49,213 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:01:49,213 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:01:49,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88131588] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:49,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:01:49,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 14 [2024-10-11 18:01:49,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762534170] [2024-10-11 18:01:49,332 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:01:49,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 18:01:49,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:49,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 18:01:49,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2024-10-11 18:01:49,334 INFO L87 Difference]: Start difference. First operand 378 states and 499 transitions. Second operand has 16 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:01:49,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:49,957 INFO L93 Difference]: Finished difference Result 507 states and 621 transitions. [2024-10-11 18:01:49,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 18:01:49,958 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2024-10-11 18:01:49,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:49,960 INFO L225 Difference]: With dead ends: 507 [2024-10-11 18:01:49,960 INFO L226 Difference]: Without dead ends: 507 [2024-10-11 18:01:49,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=260, Invalid=796, Unknown=0, NotChecked=0, Total=1056 [2024-10-11 18:01:49,961 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 538 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:49,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 176 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:01:49,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2024-10-11 18:01:49,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 463. [2024-10-11 18:01:49,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 419 states have (on average 1.334128878281623) internal successors, (559), 440 states have internal predecessors, (559), 11 states have call successors, (11), 11 states have call predecessors, (11), 21 states have return successors, (27), 11 states have call predecessors, (27), 11 states have call successors, (27) [2024-10-11 18:01:49,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 597 transitions. [2024-10-11 18:01:49,978 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 597 transitions. Word has length 29 [2024-10-11 18:01:49,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:49,978 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 597 transitions. [2024-10-11 18:01:49,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 10 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:01:49,979 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 597 transitions. [2024-10-11 18:01:49,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-11 18:01:49,980 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:49,980 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:01:50,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 18:01:50,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:50,181 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 18:01:50,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:50,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1854582443, now seen corresponding path program 1 times [2024-10-11 18:01:50,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:50,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805208439] [2024-10-11 18:01:50,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:50,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:50,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:50,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:01:50,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:50,457 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:01:50,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:50,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805208439] [2024-10-11 18:01:50,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805208439] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:50,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254142485] [2024-10-11 18:01:50,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:50,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:50,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:01:50,460 INFO L229 MonitoredProcess]: Starting monitored process 10 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 18:01:50,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 18:01:50,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:50,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-11 18:01:50,538 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:01:50,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:01:50,774 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 18:01:50,921 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:01:50,921 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:01:51,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254142485] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:51,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:01:51,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 16 [2024-10-11 18:01:51,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29918115] [2024-10-11 18:01:51,094 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:01:51,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 18:01:51,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:51,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 18:01:51,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2024-10-11 18:01:51,095 INFO L87 Difference]: Start difference. First operand 463 states and 597 transitions. Second operand has 18 states, 15 states have (on average 4.0) internal successors, (60), 14 states have internal predecessors, (60), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:01:51,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:51,631 INFO L93 Difference]: Finished difference Result 477 states and 590 transitions. [2024-10-11 18:01:51,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 18:01:51,632 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 4.0) internal successors, (60), 14 states have internal predecessors, (60), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2024-10-11 18:01:51,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:51,634 INFO L225 Difference]: With dead ends: 477 [2024-10-11 18:01:51,634 INFO L226 Difference]: Without dead ends: 477 [2024-10-11 18:01:51,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=219, Invalid=773, Unknown=0, NotChecked=0, Total=992 [2024-10-11 18:01:51,636 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 292 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:51,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 120 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:01:51,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2024-10-11 18:01:51,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 460. [2024-10-11 18:01:51,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 419 states have (on average 1.2840095465393795) internal successors, (538), 437 states have internal predecessors, (538), 11 states have call successors, (11), 11 states have call predecessors, (11), 21 states have return successors, (27), 11 states have call predecessors, (27), 11 states have call successors, (27) [2024-10-11 18:01:51,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 576 transitions. [2024-10-11 18:01:51,652 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 576 transitions. Word has length 33 [2024-10-11 18:01:51,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:51,652 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 576 transitions. [2024-10-11 18:01:51,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 4.0) internal successors, (60), 14 states have internal predecessors, (60), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 18:01:51,652 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 576 transitions. [2024-10-11 18:01:51,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 18:01:51,653 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:51,653 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:01:51,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-11 18:01:51,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:51,854 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 18:01:51,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:51,855 INFO L85 PathProgramCache]: Analyzing trace with hash 2145365376, now seen corresponding path program 1 times [2024-10-11 18:01:51,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:51,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390299010] [2024-10-11 18:01:51,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:51,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:51,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:51,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:01:51,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:52,055 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:01:52,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:52,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390299010] [2024-10-11 18:01:52,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390299010] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:52,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098510505] [2024-10-11 18:01:52,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:52,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:52,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:01:52,059 INFO L229 MonitoredProcess]: Starting monitored process 11 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 18:01:52,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 18:01:52,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:52,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 18:01:52,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:01:52,306 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:01:52,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-10-11 18:01:52,379 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 18:01:52,379 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:01:52,407 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 24 treesize of output 20 [2024-10-11 18:01:52,615 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 24 treesize of output 20 [2024-10-11 18:01:52,635 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 18:01:52,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098510505] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:01:52,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:01:52,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2024-10-11 18:01:52,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243031414] [2024-10-11 18:01:52,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:01:52,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 18:01:52,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:52,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 18:01:52,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-10-11 18:01:52,638 INFO L87 Difference]: Start difference. First operand 460 states and 576 transitions. Second operand has 17 states, 12 states have (on average 6.333333333333333) internal successors, (76), 14 states have internal predecessors, (76), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:01:53,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:53,009 INFO L93 Difference]: Finished difference Result 499 states and 602 transitions. [2024-10-11 18:01:53,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 18:01:53,009 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 12 states have (on average 6.333333333333333) internal successors, (76), 14 states have internal predecessors, (76), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 34 [2024-10-11 18:01:53,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:53,011 INFO L225 Difference]: With dead ends: 499 [2024-10-11 18:01:53,011 INFO L226 Difference]: Without dead ends: 499 [2024-10-11 18:01:53,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2024-10-11 18:01:53,012 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 379 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:53,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 138 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:01:53,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2024-10-11 18:01:53,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 463. [2024-10-11 18:01:53,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 422 states have (on average 1.2819905213270142) internal successors, (541), 440 states have internal predecessors, (541), 11 states have call successors, (11), 11 states have call predecessors, (11), 21 states have return successors, (26), 11 states have call predecessors, (26), 11 states have call successors, (26) [2024-10-11 18:01:53,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 578 transitions. [2024-10-11 18:01:53,023 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 578 transitions. Word has length 34 [2024-10-11 18:01:53,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:53,023 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 578 transitions. [2024-10-11 18:01:53,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 12 states have (on average 6.333333333333333) internal successors, (76), 14 states have internal predecessors, (76), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:01:53,024 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 578 transitions. [2024-10-11 18:01:53,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 18:01:53,024 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:53,024 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:01:53,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-11 18:01:53,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-10-11 18:01:53,225 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 18:01:53,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:53,225 INFO L85 PathProgramCache]: Analyzing trace with hash 2081817197, now seen corresponding path program 1 times [2024-10-11 18:01:53,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:53,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204310582] [2024-10-11 18:01:53,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:53,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:53,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:53,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:01:53,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:53,787 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:01:53,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:53,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204310582] [2024-10-11 18:01:53,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204310582] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:53,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306221892] [2024-10-11 18:01:53,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:53,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:53,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:01:53,789 INFO L229 MonitoredProcess]: Starting monitored process 12 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 18:01:53,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-11 18:01:53,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:53,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 18:01:53,876 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:01:54,221 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:01:54,222 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:01:54,464 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:01:54,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306221892] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:01:54,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:01:54,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 24 [2024-10-11 18:01:54,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289157668] [2024-10-11 18:01:54,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:01:54,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-11 18:01:54,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:54,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-11 18:01:54,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2024-10-11 18:01:54,466 INFO L87 Difference]: Start difference. First operand 463 states and 578 transitions. Second operand has 25 states, 22 states have (on average 4.181818181818182) internal successors, (92), 20 states have internal predecessors, (92), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:01:55,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:55,942 INFO L93 Difference]: Finished difference Result 666 states and 800 transitions. [2024-10-11 18:01:55,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-10-11 18:01:55,942 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 4.181818181818182) internal successors, (92), 20 states have internal predecessors, (92), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 35 [2024-10-11 18:01:55,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:55,945 INFO L225 Difference]: With dead ends: 666 [2024-10-11 18:01:55,945 INFO L226 Difference]: Without dead ends: 666 [2024-10-11 18:01:55,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 720 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=553, Invalid=2527, Unknown=0, NotChecked=0, Total=3080 [2024-10-11 18:01:55,947 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 851 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:55,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 335 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 966 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 18:01:55,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2024-10-11 18:01:55,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 468. [2024-10-11 18:01:55,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 429 states have (on average 1.2703962703962703) internal successors, (545), 447 states have internal predecessors, (545), 10 states have call successors, (10), 10 states have call predecessors, (10), 20 states have return successors, (24), 10 states have call predecessors, (24), 10 states have call successors, (24) [2024-10-11 18:01:55,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 579 transitions. [2024-10-11 18:01:55,961 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 579 transitions. Word has length 35 [2024-10-11 18:01:55,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:55,962 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 579 transitions. [2024-10-11 18:01:55,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 4.181818181818182) internal successors, (92), 20 states have internal predecessors, (92), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:01:55,962 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 579 transitions. [2024-10-11 18:01:55,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-11 18:01:55,963 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:55,963 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:01:55,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-11 18:01:56,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-11 18:01:56,168 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 18:01:56,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:56,168 INFO L85 PathProgramCache]: Analyzing trace with hash 558007675, now seen corresponding path program 1 times [2024-10-11 18:01:56,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:56,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500611704] [2024-10-11 18:01:56,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:56,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:56,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:56,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:01:56,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:56,243 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 25 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:01:56,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:56,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500611704] [2024-10-11 18:01:56,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500611704] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:56,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173669515] [2024-10-11 18:01:56,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:56,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:56,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:01:56,246 INFO L229 MonitoredProcess]: Starting monitored process 13 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 18:01:56,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-11 18:01:56,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:56,324 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 18:01:56,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:01:56,350 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:01:56,350 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:01:56,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173669515] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:01:56,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:01:56,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-10-11 18:01:56,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129498511] [2024-10-11 18:01:56,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:01:56,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:01:56,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:56,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:01:56,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:01:56,352 INFO L87 Difference]: Start difference. First operand 468 states and 579 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:01:56,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:56,375 INFO L93 Difference]: Finished difference Result 281 states and 330 transitions. [2024-10-11 18:01:56,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:01:56,376 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2024-10-11 18:01:56,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:56,377 INFO L225 Difference]: With dead ends: 281 [2024-10-11 18:01:56,377 INFO L226 Difference]: Without dead ends: 281 [2024-10-11 18:01:56,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:01:56,377 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 16 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:56,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 98 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:01:56,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-10-11 18:01:56,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 277. [2024-10-11 18:01:56,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 249 states have (on average 1.2369477911646587) internal successors, (308), 262 states have internal predecessors, (308), 7 states have call successors, (7), 7 states have call predecessors, (7), 12 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2024-10-11 18:01:56,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 328 transitions. [2024-10-11 18:01:56,384 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 328 transitions. Word has length 43 [2024-10-11 18:01:56,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:56,384 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 328 transitions. [2024-10-11 18:01:56,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:01:56,385 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 328 transitions. [2024-10-11 18:01:56,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-11 18:01:56,385 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:56,385 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:01:56,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-11 18:01:56,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:56,586 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting parse_inputErr10ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 18:01:56,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:56,586 INFO L85 PathProgramCache]: Analyzing trace with hash 977756381, now seen corresponding path program 1 times [2024-10-11 18:01:56,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:56,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122812820] [2024-10-11 18:01:56,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:56,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:56,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:56,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:01:56,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:56,671 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:01:56,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:56,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122812820] [2024-10-11 18:01:56,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122812820] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:56,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661992764] [2024-10-11 18:01:56,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:56,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:56,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:01:56,674 INFO L229 MonitoredProcess]: Starting monitored process 14 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 18:01:56,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-11 18:01:56,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:56,756 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 18:01:56,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:01:56,791 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:01:56,792 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:01:56,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661992764] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:01:56,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:01:56,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2024-10-11 18:01:56,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783810749] [2024-10-11 18:01:56,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:01:56,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:01:56,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:56,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:01:56,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:01:56,794 INFO L87 Difference]: Start difference. First operand 277 states and 328 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:01:56,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:56,811 INFO L93 Difference]: Finished difference Result 276 states and 325 transitions. [2024-10-11 18:01:56,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:01:56,813 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2024-10-11 18:01:56,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:56,814 INFO L225 Difference]: With dead ends: 276 [2024-10-11 18:01:56,814 INFO L226 Difference]: Without dead ends: 276 [2024-10-11 18:01:56,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 47 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 18:01:56,815 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 25 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:56,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 74 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:01:56,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-10-11 18:01:56,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2024-10-11 18:01:56,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 249 states have (on average 1.2248995983935742) internal successors, (305), 261 states have internal predecessors, (305), 7 states have call successors, (7), 7 states have call predecessors, (7), 12 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2024-10-11 18:01:56,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 325 transitions. [2024-10-11 18:01:56,820 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 325 transitions. Word has length 44 [2024-10-11 18:01:56,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:56,820 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 325 transitions. [2024-10-11 18:01:56,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:01:56,821 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 325 transitions. [2024-10-11 18:01:56,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 18:01:56,822 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:56,822 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:01:56,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-11 18:01:57,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:57,023 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting parse_inputErr11ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 18:01:57,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:57,023 INFO L85 PathProgramCache]: Analyzing trace with hash 245676811, now seen corresponding path program 1 times [2024-10-11 18:01:57,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:57,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660229804] [2024-10-11 18:01:57,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:57,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:57,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:57,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:01:57,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:57,139 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:01:57,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:57,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660229804] [2024-10-11 18:01:57,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660229804] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:57,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902829215] [2024-10-11 18:01:57,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:57,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:57,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:01:57,142 INFO L229 MonitoredProcess]: Starting monitored process 15 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 18:01:57,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-11 18:01:57,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:57,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 18:01:57,234 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:01:57,280 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:01:57,280 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:01:57,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [902829215] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:01:57,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:01:57,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2024-10-11 18:01:57,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673729885] [2024-10-11 18:01:57,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:01:57,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:01:57,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:57,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:01:57,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:01:57,282 INFO L87 Difference]: Start difference. First operand 276 states and 325 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:01:57,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:57,314 INFO L93 Difference]: Finished difference Result 275 states and 321 transitions. [2024-10-11 18:01:57,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:01:57,314 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2024-10-11 18:01:57,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:57,315 INFO L225 Difference]: With dead ends: 275 [2024-10-11 18:01:57,315 INFO L226 Difference]: Without dead ends: 275 [2024-10-11 18:01:57,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 1 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 18:01:57,316 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 23 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:57,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 61 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:01:57,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-10-11 18:01:57,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2024-10-11 18:01:57,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 249 states have (on average 1.2088353413654618) internal successors, (301), 260 states have internal predecessors, (301), 7 states have call successors, (7), 7 states have call predecessors, (7), 12 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2024-10-11 18:01:57,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 321 transitions. [2024-10-11 18:01:57,327 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 321 transitions. Word has length 45 [2024-10-11 18:01:57,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:57,331 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 321 transitions. [2024-10-11 18:01:57,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:01:57,332 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 321 transitions. [2024-10-11 18:01:57,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 18:01:57,332 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:57,333 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:01:57,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-10-11 18:01:57,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-10-11 18:01:57,534 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting parse_inputErr12ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 18:01:57,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:57,535 INFO L85 PathProgramCache]: Analyzing trace with hash -973953377, now seen corresponding path program 1 times [2024-10-11 18:01:57,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:57,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564957836] [2024-10-11 18:01:57,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:57,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:57,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:57,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:01:57,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:57,633 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:01:57,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:57,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564957836] [2024-10-11 18:01:57,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564957836] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:57,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277768029] [2024-10-11 18:01:57,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:57,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:57,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:01:57,635 INFO L229 MonitoredProcess]: Starting monitored process 16 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 18:01:57,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-11 18:01:57,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:57,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 18:01:57,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:01:57,728 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 18:01:57,764 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:01:57,765 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:01:57,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277768029] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:01:57,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 18:01:57,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2024-10-11 18:01:57,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370483020] [2024-10-11 18:01:57,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:01:57,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:01:57,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:57,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:01:57,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:01:57,767 INFO L87 Difference]: Start difference. First operand 275 states and 321 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:01:57,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:57,824 INFO L93 Difference]: Finished difference Result 289 states and 329 transitions. [2024-10-11 18:01:57,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:01:57,825 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2024-10-11 18:01:57,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:57,826 INFO L225 Difference]: With dead ends: 289 [2024-10-11 18:01:57,826 INFO L226 Difference]: Without dead ends: 289 [2024-10-11 18:01:57,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 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 18:01:57,827 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 18 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:57,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 103 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:01:57,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-10-11 18:01:57,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 275. [2024-10-11 18:01:57,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 249 states have (on average 1.1967871485943775) internal successors, (298), 260 states have internal predecessors, (298), 7 states have call successors, (7), 7 states have call predecessors, (7), 12 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2024-10-11 18:01:57,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 318 transitions. [2024-10-11 18:01:57,833 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 318 transitions. Word has length 46 [2024-10-11 18:01:57,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:57,833 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 318 transitions. [2024-10-11 18:01:57,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:01:57,833 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 318 transitions. [2024-10-11 18:01:57,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 18:01:57,834 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:57,834 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:01:57,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-10-11 18:01:58,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-10-11 18:01:58,039 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 18:01:58,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:58,039 INFO L85 PathProgramCache]: Analyzing trace with hash -169332805, now seen corresponding path program 1 times [2024-10-11 18:01:58,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:58,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971675008] [2024-10-11 18:01:58,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:58,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:58,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:01:58,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:58,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 18:01:58,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:58,298 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 18:01:58,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:58,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971675008] [2024-10-11 18:01:58,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971675008] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:58,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668485169] [2024-10-11 18:01:58,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:58,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:58,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:01:58,301 INFO L229 MonitoredProcess]: Starting monitored process 17 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 18:01:58,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-11 18:01:58,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:58,397 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 18:01:58,399 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:01:58,493 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-11 18:01:58,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-11 18:01:58,553 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-11 18:01:58,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-11 18:01:58,589 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 18:01:58,589 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:01:58,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668485169] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:58,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:01:58,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2024-10-11 18:01:58,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322749192] [2024-10-11 18:01:58,628 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:01:58,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 18:01:58,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:01:58,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 18:01:58,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-10-11 18:01:58,629 INFO L87 Difference]: Start difference. First operand 275 states and 318 transitions. Second operand has 12 states, 10 states have (on average 4.1) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 18:01:58,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:01:58,960 INFO L93 Difference]: Finished difference Result 291 states and 328 transitions. [2024-10-11 18:01:58,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 18:01:58,960 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 4.1) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 48 [2024-10-11 18:01:58,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:01:58,961 INFO L225 Difference]: With dead ends: 291 [2024-10-11 18:01:58,962 INFO L226 Difference]: Without dead ends: 291 [2024-10-11 18:01:58,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2024-10-11 18:01:58,962 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 212 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:01:58,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 155 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:01:58,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-10-11 18:01:58,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 275. [2024-10-11 18:01:58,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 249 states have (on average 1.1847389558232932) internal successors, (295), 260 states have internal predecessors, (295), 7 states have call successors, (7), 7 states have call predecessors, (7), 12 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2024-10-11 18:01:58,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 315 transitions. [2024-10-11 18:01:58,968 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 315 transitions. Word has length 48 [2024-10-11 18:01:58,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:01:58,968 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 315 transitions. [2024-10-11 18:01:58,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 4.1) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 18:01:58,969 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 315 transitions. [2024-10-11 18:01:58,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 18:01:58,969 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:01:58,969 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:01:58,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-10-11 18:01:59,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-10-11 18:01:59,174 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 18:01:59,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:01:59,175 INFO L85 PathProgramCache]: Analyzing trace with hash -954349610, now seen corresponding path program 1 times [2024-10-11 18:01:59,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:01:59,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211928455] [2024-10-11 18:01:59,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:59,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:01:59,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:59,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:01:59,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:59,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 18:01:59,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:59,535 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:01:59,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:01:59,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211928455] [2024-10-11 18:01:59,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211928455] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:01:59,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750999257] [2024-10-11 18:01:59,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:01:59,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:01:59,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:01:59,538 INFO L229 MonitoredProcess]: Starting monitored process 18 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 18:01:59,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-10-11 18:01:59,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:01:59,629 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 18:01:59,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:01:59,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:01:59,757 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 18:01:59,808 WARN L873 $PredicateComparison]: unable to prove that (exists ((|parse_input_c1_~x~0#1.base| Int)) (let ((.cse0 (select |c_#length| |parse_input_c1_~x~0#1.base|))) (and (<= 1 .cse0) (= (store |c_old(#length)| |parse_input_c1_~x~0#1.base| .cse0) |c_#length|)))) is different from true [2024-10-11 18:01:59,844 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:01:59,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-10-11 18:01:59,931 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-10-11 18:01:59,932 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:02:00,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1750999257] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:02:00,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:02:00,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 21 [2024-10-11 18:02:00,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977414356] [2024-10-11 18:02:00,190 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:02:00,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-11 18:02:00,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:02:00,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-11 18:02:00,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=545, Unknown=1, NotChecked=48, Total=702 [2024-10-11 18:02:00,191 INFO L87 Difference]: Start difference. First operand 275 states and 315 transitions. Second operand has 23 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:02:00,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:02:00,850 INFO L93 Difference]: Finished difference Result 304 states and 336 transitions. [2024-10-11 18:02:00,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 18:02:00,850 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 49 [2024-10-11 18:02:00,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:02:00,851 INFO L225 Difference]: With dead ends: 304 [2024-10-11 18:02:00,852 INFO L226 Difference]: Without dead ends: 304 [2024-10-11 18:02:00,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=411, Invalid=1232, Unknown=1, NotChecked=78, Total=1722 [2024-10-11 18:02:00,853 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 312 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:02:00,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 261 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 375 Invalid, 0 Unknown, 95 Unchecked, 0.3s Time] [2024-10-11 18:02:00,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-10-11 18:02:00,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 274. [2024-10-11 18:02:00,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 249 states have (on average 1.1526104417670682) internal successors, (287), 259 states have internal predecessors, (287), 7 states have call successors, (7), 7 states have call predecessors, (7), 12 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2024-10-11 18:02:00,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 307 transitions. [2024-10-11 18:02:00,860 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 307 transitions. Word has length 49 [2024-10-11 18:02:00,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:02:00,860 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 307 transitions. [2024-10-11 18:02:00,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:02:00,861 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 307 transitions. [2024-10-11 18:02:00,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 18:02:00,861 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:02:00,861 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:02:00,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-10-11 18:02:01,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-10-11 18:02:01,066 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 18:02:01,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:02:01,066 INFO L85 PathProgramCache]: Analyzing trace with hash 139291547, now seen corresponding path program 1 times [2024-10-11 18:02:01,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:02:01,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116924712] [2024-10-11 18:02:01,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:01,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:02:01,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:01,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:02:01,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:01,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 18:02:01,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:01,277 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 18:02:01,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:02:01,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116924712] [2024-10-11 18:02:01,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116924712] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:02:01,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332661318] [2024-10-11 18:02:01,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:01,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:02:01,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:02:01,279 INFO L229 MonitoredProcess]: Starting monitored process 19 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 18:02:01,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-10-11 18:02:01,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:01,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-11 18:02:01,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:01,471 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:02:01,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:02:01,638 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:02:01,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-10-11 18:02:01,695 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 18:02:01,696 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:02:01,725 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 24 treesize of output 20 [2024-10-11 18:02:01,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 24 treesize of output 20 [2024-10-11 18:02:02,007 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 18:02:02,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332661318] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:02:02,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:02:02,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 22 [2024-10-11 18:02:02,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864278096] [2024-10-11 18:02:02,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:02:02,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-11 18:02:02,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:02:02,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-11 18:02:02,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2024-10-11 18:02:02,010 INFO L87 Difference]: Start difference. First operand 274 states and 307 transitions. Second operand has 23 states, 20 states have (on average 6.45) internal successors, (129), 21 states have internal predecessors, (129), 6 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 18:02:02,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:02:02,214 INFO L93 Difference]: Finished difference Result 284 states and 317 transitions. [2024-10-11 18:02:02,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:02:02,214 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 6.45) internal successors, (129), 21 states have internal predecessors, (129), 6 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Word has length 54 [2024-10-11 18:02:02,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:02:02,215 INFO L225 Difference]: With dead ends: 284 [2024-10-11 18:02:02,215 INFO L226 Difference]: Without dead ends: 284 [2024-10-11 18:02:02,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=579, Unknown=0, NotChecked=0, Total=756 [2024-10-11 18:02:02,216 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 216 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:02:02,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 76 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:02:02,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-10-11 18:02:02,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 273. [2024-10-11 18:02:02,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 249 states have (on average 1.1485943775100402) internal successors, (286), 258 states have internal predecessors, (286), 7 states have call successors, (7), 7 states have call predecessors, (7), 12 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2024-10-11 18:02:02,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 306 transitions. [2024-10-11 18:02:02,222 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 306 transitions. Word has length 54 [2024-10-11 18:02:02,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:02:02,222 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 306 transitions. [2024-10-11 18:02:02,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 6.45) internal successors, (129), 21 states have internal predecessors, (129), 6 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 18:02:02,222 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 306 transitions. [2024-10-11 18:02:02,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 18:02:02,223 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:02:02,223 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:02:02,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-10-11 18:02:02,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-10-11 18:02:02,428 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 18:02:02,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:02:02,428 INFO L85 PathProgramCache]: Analyzing trace with hash 23070642, now seen corresponding path program 1 times [2024-10-11 18:02:02,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:02:02,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593506532] [2024-10-11 18:02:02,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:02,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:02:02,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:02,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:02:02,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:02,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 18:02:02,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:02,987 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 18:02:02,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:02:02,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593506532] [2024-10-11 18:02:02,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593506532] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:02:02,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286193295] [2024-10-11 18:02:02,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:02,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:02:02,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:02:02,993 INFO L229 MonitoredProcess]: Starting monitored process 20 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 18:02:02,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-10-11 18:02:03,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:03,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-11 18:02:03,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:03,277 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:02:03,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:02:03,566 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:02:03,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-10-11 18:02:03,710 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 18:02:03,710 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:02:03,768 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 40 treesize of output 28 [2024-10-11 18:02:03,958 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:02:03,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 40 [2024-10-11 18:02:04,204 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 1 proven. 35 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 18:02:04,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286193295] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:02:04,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:02:04,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 13] total 39 [2024-10-11 18:02:04,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890042714] [2024-10-11 18:02:04,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:02:04,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-11 18:02:04,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:02:04,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-11 18:02:04,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1467, Unknown=0, NotChecked=0, Total=1640 [2024-10-11 18:02:04,208 INFO L87 Difference]: Start difference. First operand 273 states and 306 transitions. Second operand has 41 states, 35 states have (on average 3.914285714285714) internal successors, (137), 32 states have internal predecessors, (137), 8 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 18:02:04,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:02:04,795 INFO L93 Difference]: Finished difference Result 284 states and 316 transitions. [2024-10-11 18:02:04,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 18:02:04,795 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 35 states have (on average 3.914285714285714) internal successors, (137), 32 states have internal predecessors, (137), 8 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 55 [2024-10-11 18:02:04,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:02:04,796 INFO L225 Difference]: With dead ends: 284 [2024-10-11 18:02:04,796 INFO L226 Difference]: Without dead ends: 284 [2024-10-11 18:02:04,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=366, Invalid=1986, Unknown=0, NotChecked=0, Total=2352 [2024-10-11 18:02:04,797 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 352 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:02:04,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 219 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 18:02:04,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-10-11 18:02:04,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 273. [2024-10-11 18:02:04,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 249 states have (on average 1.144578313253012) internal successors, (285), 258 states have internal predecessors, (285), 7 states have call successors, (7), 7 states have call predecessors, (7), 12 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2024-10-11 18:02:04,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 305 transitions. [2024-10-11 18:02:04,803 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 305 transitions. Word has length 55 [2024-10-11 18:02:04,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:02:04,803 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 305 transitions. [2024-10-11 18:02:04,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 35 states have (on average 3.914285714285714) internal successors, (137), 32 states have internal predecessors, (137), 8 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 18:02:04,803 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 305 transitions. [2024-10-11 18:02:04,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 18:02:04,804 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:02:04,804 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:02:04,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-10-11 18:02:05,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,20 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:02:05,006 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 18:02:05,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:02:05,007 INFO L85 PathProgramCache]: Analyzing trace with hash 861481531, now seen corresponding path program 1 times [2024-10-11 18:02:05,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:02:05,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83703484] [2024-10-11 18:02:05,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:05,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:02:05,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:05,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:02:05,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:05,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 18:02:05,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:05,624 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 18:02:05,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:02:05,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83703484] [2024-10-11 18:02:05,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83703484] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:02:05,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579339694] [2024-10-11 18:02:05,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:05,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:02:05,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:02:05,627 INFO L229 MonitoredProcess]: Starting monitored process 21 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 18:02:05,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-10-11 18:02:05,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:05,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-11 18:02:05,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:05,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:02:06,001 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 18:02:06,232 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:02:06,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-10-11 18:02:06,457 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:02:06,457 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:02:06,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579339694] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:02:06,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:02:06,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 24 [2024-10-11 18:02:06,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831902026] [2024-10-11 18:02:06,701 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:02:06,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 18:02:06,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:02:06,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 18:02:06,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=812, Unknown=0, NotChecked=0, Total=930 [2024-10-11 18:02:06,702 INFO L87 Difference]: Start difference. First operand 273 states and 305 transitions. Second operand has 26 states, 21 states have (on average 4.761904761904762) internal successors, (100), 20 states have internal predecessors, (100), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:02:07,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:02:07,917 INFO L93 Difference]: Finished difference Result 299 states and 329 transitions. [2024-10-11 18:02:07,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-11 18:02:07,918 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 21 states have (on average 4.761904761904762) internal successors, (100), 20 states have internal predecessors, (100), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 55 [2024-10-11 18:02:07,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:02:07,919 INFO L225 Difference]: With dead ends: 299 [2024-10-11 18:02:07,919 INFO L226 Difference]: Without dead ends: 299 [2024-10-11 18:02:07,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 614 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=644, Invalid=2326, Unknown=0, NotChecked=0, Total=2970 [2024-10-11 18:02:07,921 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 631 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:02:07,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 177 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:02:07,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-10-11 18:02:07,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 233. [2024-10-11 18:02:07,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 214 states have (on average 1.1401869158878504) internal successors, (244), 220 states have internal predecessors, (244), 6 states have call successors, (6), 6 states have call predecessors, (6), 9 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-10-11 18:02:07,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 259 transitions. [2024-10-11 18:02:07,926 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 259 transitions. Word has length 55 [2024-10-11 18:02:07,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:02:07,927 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 259 transitions. [2024-10-11 18:02:07,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 21 states have (on average 4.761904761904762) internal successors, (100), 20 states have internal predecessors, (100), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 18:02:07,927 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 259 transitions. [2024-10-11 18:02:07,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 18:02:07,928 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:02:07,928 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:02:07,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-10-11 18:02:08,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,21 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:02:08,133 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 18:02:08,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:02:08,133 INFO L85 PathProgramCache]: Analyzing trace with hash 696051924, now seen corresponding path program 1 times [2024-10-11 18:02:08,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:02:08,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230082429] [2024-10-11 18:02:08,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:08,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:02:08,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:08,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:02:08,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:08,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 18:02:08,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:08,459 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 18:02:08,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:02:08,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230082429] [2024-10-11 18:02:08,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230082429] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:02:08,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486336102] [2024-10-11 18:02:08,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:08,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:02:08,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:02:08,462 INFO L229 MonitoredProcess]: Starting monitored process 22 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 18:02:08,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-10-11 18:02:08,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:08,557 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 18:02:08,559 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:08,635 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-11 18:02:08,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-11 18:02:08,741 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 18:02:08,786 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 20 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-11 18:02:08,786 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:02:09,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486336102] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:02:09,047 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:02:09,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2024-10-11 18:02:09,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656766151] [2024-10-11 18:02:09,047 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:02:09,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 18:02:09,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:02:09,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 18:02:09,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2024-10-11 18:02:09,048 INFO L87 Difference]: Start difference. First operand 233 states and 259 transitions. Second operand has 18 states, 15 states have (on average 5.4) internal successors, (81), 13 states have internal predecessors, (81), 2 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 18:02:09,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:02:09,358 INFO L93 Difference]: Finished difference Result 246 states and 272 transitions. [2024-10-11 18:02:09,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 18:02:09,358 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 5.4) internal successors, (81), 13 states have internal predecessors, (81), 2 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 57 [2024-10-11 18:02:09,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:02:09,359 INFO L225 Difference]: With dead ends: 246 [2024-10-11 18:02:09,359 INFO L226 Difference]: Without dead ends: 246 [2024-10-11 18:02:09,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=687, Unknown=0, NotChecked=0, Total=930 [2024-10-11 18:02:09,360 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 219 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:02:09,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 168 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:02:09,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-10-11 18:02:09,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 232. [2024-10-11 18:02:09,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 214 states have (on average 1.1355140186915889) internal successors, (243), 219 states have internal predecessors, (243), 6 states have call successors, (6), 6 states have call predecessors, (6), 9 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-10-11 18:02:09,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 258 transitions. [2024-10-11 18:02:09,365 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 258 transitions. Word has length 57 [2024-10-11 18:02:09,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:02:09,365 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 258 transitions. [2024-10-11 18:02:09,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 5.4) internal successors, (81), 13 states have internal predecessors, (81), 2 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 18:02:09,365 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 258 transitions. [2024-10-11 18:02:09,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-11 18:02:09,366 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:02:09,366 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:02:09,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-10-11 18:02:09,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-10-11 18:02:09,567 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 18:02:09,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:02:09,567 INFO L85 PathProgramCache]: Analyzing trace with hash -355197301, now seen corresponding path program 2 times [2024-10-11 18:02:09,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:02:09,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898127716] [2024-10-11 18:02:09,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:09,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:02:09,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:09,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 18:02:09,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:09,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 18:02:09,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:09,960 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 18 proven. 39 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 18:02:09,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:02:09,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898127716] [2024-10-11 18:02:09,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898127716] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:02:09,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457173081] [2024-10-11 18:02:09,960 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 18:02:09,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:02:09,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:02:09,963 INFO L229 MonitoredProcess]: Starting monitored process 23 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 18:02:09,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-10-11 18:02:10,068 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 18:02:10,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 18:02:10,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-11 18:02:10,072 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:10,246 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:02:10,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 18:02:10,514 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:02:10,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-10-11 18:02:10,730 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 2 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:02:10,731 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:02:10,959 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 48 treesize of output 32 [2024-10-11 18:02:11,102 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:02:11,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 46 [2024-10-11 18:02:11,426 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 1 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:02:11,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457173081] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:02:11,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:02:11,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 16] total 42 [2024-10-11 18:02:11,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491620589] [2024-10-11 18:02:11,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:02:11,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-10-11 18:02:11,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:02:11,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-10-11 18:02:11,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1689, Unknown=0, NotChecked=0, Total=1892 [2024-10-11 18:02:11,429 INFO L87 Difference]: Start difference. First operand 232 states and 258 transitions. Second operand has 44 states, 39 states have (on average 4.282051282051282) internal successors, (167), 36 states have internal predecessors, (167), 7 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 18:02:12,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:02:12,142 INFO L93 Difference]: Finished difference Result 245 states and 271 transitions. [2024-10-11 18:02:12,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 18:02:12,142 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 39 states have (on average 4.282051282051282) internal successors, (167), 36 states have internal predecessors, (167), 7 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 63 [2024-10-11 18:02:12,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:02:12,143 INFO L225 Difference]: With dead ends: 245 [2024-10-11 18:02:12,143 INFO L226 Difference]: Without dead ends: 245 [2024-10-11 18:02:12,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=463, Invalid=2399, Unknown=0, NotChecked=0, Total=2862 [2024-10-11 18:02:12,145 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 369 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:02:12,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 228 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 18:02:12,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-10-11 18:02:12,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 231. [2024-10-11 18:02:12,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 214 states have (on average 1.1308411214953271) internal successors, (242), 218 states have internal predecessors, (242), 6 states have call successors, (6), 6 states have call predecessors, (6), 9 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-10-11 18:02:12,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 257 transitions. [2024-10-11 18:02:12,152 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 257 transitions. Word has length 63 [2024-10-11 18:02:12,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:02:12,152 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 257 transitions. [2024-10-11 18:02:12,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 39 states have (on average 4.282051282051282) internal successors, (167), 36 states have internal predecessors, (167), 7 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 18:02:12,152 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 257 transitions. [2024-10-11 18:02:12,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-11 18:02:12,153 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:02:12,153 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:02:12,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2024-10-11 18:02:12,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,23 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:02:12,354 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 18:02:12,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:02:12,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1323634330, now seen corresponding path program 1 times [2024-10-11 18:02:12,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:02:12,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269807856] [2024-10-11 18:02:12,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:12,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:02:12,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 18:02:12,386 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 18:02:12,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 18:02:12,443 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 18:02:12,444 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 18:02:12,445 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (19 of 20 remaining) [2024-10-11 18:02:12,448 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 20 remaining) [2024-10-11 18:02:12,448 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 20 remaining) [2024-10-11 18:02:12,449 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (16 of 20 remaining) [2024-10-11 18:02:12,449 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (15 of 20 remaining) [2024-10-11 18:02:12,449 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE (14 of 20 remaining) [2024-10-11 18:02:12,449 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE (13 of 20 remaining) [2024-10-11 18:02:12,449 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 20 remaining) [2024-10-11 18:02:12,449 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 20 remaining) [2024-10-11 18:02:12,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 20 remaining) [2024-10-11 18:02:12,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 20 remaining) [2024-10-11 18:02:12,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr10ASSERT_VIOLATIONMEMORY_FREE (8 of 20 remaining) [2024-10-11 18:02:12,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr11ASSERT_VIOLATIONMEMORY_FREE (7 of 20 remaining) [2024-10-11 18:02:12,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr12ASSERT_VIOLATIONMEMORY_FREE (6 of 20 remaining) [2024-10-11 18:02:12,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr13ASSERT_VIOLATIONMEMORY_FREE (5 of 20 remaining) [2024-10-11 18:02:12,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr14ASSERT_VIOLATIONMEMORY_FREE (4 of 20 remaining) [2024-10-11 18:02:12,451 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr15ASSERT_VIOLATIONMEMORY_FREE (3 of 20 remaining) [2024-10-11 18:02:12,451 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr16ASSERT_VIOLATIONMEMORY_FREE (2 of 20 remaining) [2024-10-11 18:02:12,451 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr17ASSERT_VIOLATIONMEMORY_FREE (1 of 20 remaining) [2024-10-11 18:02:12,451 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr18ASSERT_VIOLATIONMEMORY_FREE (0 of 20 remaining) [2024-10-11 18:02:12,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-11 18:02:12,454 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:02:12,519 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 18:02:12,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 06:02:12 BoogieIcfgContainer [2024-10-11 18:02:12,523 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 18:02:12,524 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 18:02:12,524 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 18:02:12,524 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 18:02:12,525 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:01:36" (3/4) ... [2024-10-11 18:02:12,527 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 18:02:12,528 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 18:02:12,528 INFO L158 Benchmark]: Toolchain (without parser) took 37052.23ms. Allocated memory was 165.7MB in the beginning and 314.6MB in the end (delta: 148.9MB). Free memory was 108.1MB in the beginning and 272.2MB in the end (delta: -164.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 18:02:12,528 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 165.7MB. Free memory was 126.0MB in the beginning and 125.9MB in the end (delta: 176.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 18:02:12,529 INFO L158 Benchmark]: CACSL2BoogieTranslator took 591.94ms. Allocated memory is still 165.7MB. Free memory was 108.1MB in the beginning and 86.2MB in the end (delta: 21.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 18:02:12,529 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.65ms. Allocated memory is still 165.7MB. Free memory was 86.2MB in the beginning and 83.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 18:02:12,529 INFO L158 Benchmark]: Boogie Preprocessor took 79.77ms. Allocated memory is still 165.7MB. Free memory was 83.8MB in the beginning and 81.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 18:02:12,530 INFO L158 Benchmark]: RCFGBuilder took 564.96ms. Allocated memory was 165.7MB in the beginning and 218.1MB in the end (delta: 52.4MB). Free memory was 81.3MB in the beginning and 182.0MB in the end (delta: -100.7MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. [2024-10-11 18:02:12,530 INFO L158 Benchmark]: TraceAbstraction took 35743.85ms. Allocated memory was 218.1MB in the beginning and 314.6MB in the end (delta: 96.5MB). Free memory was 180.9MB in the beginning and 272.2MB in the end (delta: -91.3MB). Peak memory consumption was 184.5MB. Max. memory is 16.1GB. [2024-10-11 18:02:12,531 INFO L158 Benchmark]: Witness Printer took 3.71ms. Allocated memory is still 314.6MB. Free memory is still 272.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 18:02:12,531 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 165.7MB. Free memory was 126.0MB in the beginning and 125.9MB in the end (delta: 176.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 591.94ms. Allocated memory is still 165.7MB. Free memory was 108.1MB in the beginning and 86.2MB in the end (delta: 21.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.65ms. Allocated memory is still 165.7MB. Free memory was 86.2MB in the beginning and 83.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.77ms. Allocated memory is still 165.7MB. Free memory was 83.8MB in the beginning and 81.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 564.96ms. Allocated memory was 165.7MB in the beginning and 218.1MB in the end (delta: 52.4MB). Free memory was 81.3MB in the beginning and 182.0MB in the end (delta: -100.7MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. * TraceAbstraction took 35743.85ms. Allocated memory was 218.1MB in the beginning and 314.6MB in the end (delta: 96.5MB). Free memory was 180.9MB in the beginning and 272.2MB in the end (delta: -91.3MB). Peak memory consumption was 184.5MB. Max. memory is 16.1GB. * Witness Printer took 3.71ms. Allocated memory is still 314.6MB. Free memory is still 272.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: 721]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of strcmp at line 693, overapproximation of memtrack at line 721. Possible FailurePath: [L685] int state = STATE_1; [L686] char *global = 0; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L687-L690] const struct command commands[] = { {"c1",c1,STATE_1}, {"c2",c2,STATE_2} }; [L722] CALL parse_input("c1") VAL [\old(state)=0, commands={6:0}, global={0:0}, state=0] [L692] int i = 0; VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L692] COND TRUE i < 2 VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L693] EXPR commands[i].name VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L693] COND TRUE strcmp(commands[i].name,input) == 0 [L694] EXPR commands[i].state_needed VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, i=0, input={3:0}, state=0] [L694] COND TRUE state >= commands[i].state_needed [L695] EXPR commands[i].function [L695] CALL commands[i].function() [L702] char *x = (char *)malloc(sizeof(char)); [L703] COND FALSE !(!x) VAL [\old(state)=0, commands={6:0}, global={0:0}, state=0, x={-3:0}] [L706] COND FALSE !(\read(*global)) VAL [\old(state)=0, commands={6:0}, global={0:0}, state=0, x={-3:0}] [L708] global = x [L709] state = STATE_2 VAL [\old(state)=0, commands={6:0}, global={-3:0}, state=1] [L695] RET commands[i].function() [L722] RET parse_input("c1") VAL [commands={6:0}, global={-3:0}, state=1] [L723] CALL parse_input("c1") VAL [\old(state)=1, commands={6:0}, global={-3:0}, state=1] [L692] int i = 0; VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={-3:0}, i=0, input={4:0}, state=1] [L692] COND TRUE i < 2 VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={-3:0}, i=0, input={4:0}, state=1] [L693] EXPR commands[i].name VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={-3:0}, i=0, input={4:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={-3:0}, i=0, input={4:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={-3:0}, i=0, input={4:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={-3:0}, i=0, input={4:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={-3:0}, i=0, input={4:0}, state=1] [L693] COND TRUE strcmp(commands[i].name,input) == 0 [L694] EXPR commands[i].state_needed VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={-3:0}, i=0, input={4:0}, state=1] [L694] COND TRUE state >= commands[i].state_needed [L695] EXPR commands[i].function [L695] CALL commands[i].function() [L702] char *x = (char *)malloc(sizeof(char)); [L703] COND FALSE !(!x) VAL [\old(state)=1, commands={6:0}, global={-3:0}, state=1, x={7:0}] [L706] COND TRUE \read(*global) VAL [\old(state)=1, commands={6:0}, global={-3:0}, state=1, x={7:0}] [L708] global = x [L709] state = STATE_2 VAL [\old(state)=1, commands={6:0}, global={7:0}, state=1] [L695] RET commands[i].function() [L723] RET parse_input("c1") VAL [commands={6:0}, global={7:0}, state=1] [L724] CALL parse_input("c2") VAL [\old(state)=1, commands={6:0}, global={7:0}, state=1] [L692] int i = 0; VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L692] COND TRUE i < 2 VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L693] EXPR commands[i].name VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L693] EXPR strcmp(commands[i].name,input) VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L693] COND TRUE strcmp(commands[i].name,input) == 0 [L694] EXPR commands[i].state_needed VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, i=0, input={5:0}, state=1] [L694] COND TRUE state >= commands[i].state_needed [L695] EXPR commands[i].function [L695] CALL commands[i].function() [L702] char *x = (char *)malloc(sizeof(char)); [L703] COND FALSE !(!x) VAL [\old(state)=1, commands={6:0}, global={7:0}, state=1, x={-6:0}] [L706] COND TRUE \read(*global) VAL [\old(state)=1, commands={6:0}, global={7:0}, state=1, x={-6:0}] [L708] global = x [L709] state = STATE_2 VAL [\old(state)=1, commands={6:0}, global={-6:0}, state=1] [L695] RET commands[i].function() [L724] RET parse_input("c2") VAL [commands={6:0}, global={-6:0}, state=1] [L725] return 0; VAL [\result=0, commands={6:0}, global={-6:0}, state=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: 693]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 693]: 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: 714]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 717]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 717]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 717]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 59 locations, 20 error locations. Started 1 CEGAR loops. OverallTime: 35.6s, OverallIterations: 34, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 11.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6867 SdHoareTripleChecker+Valid, 5.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6867 mSDsluCounter, 5697 SdHoareTripleChecker+Invalid, 5.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 95 IncrementalHoareTripleChecker+Unchecked, 4426 mSDsCounter, 792 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7903 IncrementalHoareTripleChecker+Invalid, 8790 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 792 mSolverCounterUnsat, 1271 mSDtfsCounter, 7903 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1674 GetRequests, 1079 SyntacticMatches, 4 SemanticMatches, 591 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4041 ImplicationChecksByTransitivity, 9.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=468occurred in iteration=22, InterpolantAutomatonStates: 322, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 33 MinimizatonAttempts, 927 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 16.8s InterpolantComputationTime, 1876 NumberOfCodeBlocks, 1876 NumberOfCodeBlocksAsserted, 57 NumberOfCheckSat, 2033 ConstructedInterpolants, 159 QuantifiedInterpolants, 25035 SizeOfPredicates, 83 NumberOfNonLiveVariables, 5427 ConjunctsInSsa, 388 ConjunctsInUnsatCore, 63 InterpolantComputations, 16 PerfectInterpolantSequences, 408/1149 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 18:02:12,571 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/memsafety-bftpd/bftpd_3.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 6826aeecba49275836b6b398765a757158a4e84d2c6569399d77f2320562875e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 18:02:14,752 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 18:02:14,830 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-11 18:02:14,838 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 18:02:14,838 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 18:02:14,874 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 18:02:14,875 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 18:02:14,875 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 18:02:14,876 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 18:02:14,876 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 18:02:14,878 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 18:02:14,878 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 18:02:14,879 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 18:02:14,879 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 18:02:14,880 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 18:02:14,880 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 18:02:14,880 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 18:02:14,881 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 18:02:14,881 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 18:02:14,883 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 18:02:14,884 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 18:02:14,885 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 18:02:14,885 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 18:02:14,885 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 18:02:14,886 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 18:02:14,886 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 18:02:14,886 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 18:02:14,886 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 18:02:14,887 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 18:02:14,887 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 18:02:14,887 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 18:02:14,888 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 18:02:14,888 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 18:02:14,891 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 18:02:14,891 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 18:02:14,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:02:14,892 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 18:02:14,892 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 18:02:14,892 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 18:02:14,892 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 18:02:14,892 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 18:02:14,893 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 18:02:14,893 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 18:02:14,893 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 18:02:14,894 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 18:02:14,894 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 -> 6826aeecba49275836b6b398765a757158a4e84d2c6569399d77f2320562875e [2024-10-11 18:02:15,239 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 18:02:15,261 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 18:02:15,265 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 18:02:15,266 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 18:02:15,267 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 18:02:15,269 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_3.i [2024-10-11 18:02:16,809 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 18:02:17,076 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 18:02:17,077 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_3.i [2024-10-11 18:02:17,103 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/daded3fb4/531168fa925a4ca79e6af227cc97dc17/FLAG8b2deb09d [2024-10-11 18:02:17,397 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/daded3fb4/531168fa925a4ca79e6af227cc97dc17 [2024-10-11 18:02:17,399 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 18:02:17,400 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 18:02:17,401 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 18:02:17,401 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 18:02:17,406 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 18:02:17,407 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:02:17" (1/1) ... [2024-10-11 18:02:17,408 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@301901ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:02:17, skipping insertion in model container [2024-10-11 18:02:17,408 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:02:17" (1/1) ... [2024-10-11 18:02:17,451 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 18:02:17,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:02:17,874 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 18:02:17,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:02:17,983 INFO L204 MainTranslator]: Completed translation [2024-10-11 18:02:17,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:02:17 WrapperNode [2024-10-11 18:02:17,984 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 18:02:17,985 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 18:02:17,985 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 18:02:17,985 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 18:02:17,992 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:02:17" (1/1) ... [2024-10-11 18:02:18,018 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:02:17" (1/1) ... [2024-10-11 18:02:18,046 INFO L138 Inliner]: procedures = 169, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 96 [2024-10-11 18:02:18,049 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 18:02:18,050 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 18:02:18,050 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 18:02:18,050 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 18:02:18,060 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:02:17" (1/1) ... [2024-10-11 18:02:18,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:02:17" (1/1) ... [2024-10-11 18:02:18,063 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:02:17" (1/1) ... [2024-10-11 18:02:18,091 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [9, 6, 9]. 38 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [6, 6, 9]. The 0 writes are split as follows [0, 0, 0]. [2024-10-11 18:02:18,092 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:02:17" (1/1) ... [2024-10-11 18:02:18,093 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:02:17" (1/1) ... [2024-10-11 18:02:18,105 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:02:17" (1/1) ... [2024-10-11 18:02:18,108 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:02:17" (1/1) ... [2024-10-11 18:02:18,114 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:02:17" (1/1) ... [2024-10-11 18:02:18,115 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:02:17" (1/1) ... [2024-10-11 18:02:18,119 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 18:02:18,120 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 18:02:18,120 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 18:02:18,120 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 18:02:18,121 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:02:17" (1/1) ... [2024-10-11 18:02:18,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:02:18,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:02:18,165 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 18:02:18,167 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 18:02:18,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 18:02:18,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 18:02:18,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-11 18:02:18,228 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2024-10-11 18:02:18,228 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2024-10-11 18:02:18,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 18:02:18,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 18:02:18,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 18:02:18,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 18:02:18,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 18:02:18,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 18:02:18,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 18:02:18,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 18:02:18,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 18:02:18,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 18:02:18,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 18:02:18,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 18:02:18,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 18:02:18,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 18:02:18,378 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 18:02:18,380 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 18:02:18,657 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-10-11 18:02:18,661 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 18:02:18,707 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 18:02:18,708 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 18:02:18,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:02:18 BoogieIcfgContainer [2024-10-11 18:02:18,708 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 18:02:18,710 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 18:02:18,710 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 18:02:18,713 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 18:02:18,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:02:17" (1/3) ... [2024-10-11 18:02:18,714 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f17821 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:02:18, skipping insertion in model container [2024-10-11 18:02:18,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:02:17" (2/3) ... [2024-10-11 18:02:18,715 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f17821 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:02:18, skipping insertion in model container [2024-10-11 18:02:18,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:02:18" (3/3) ... [2024-10-11 18:02:18,720 INFO L112 eAbstractionObserver]: Analyzing ICFG bftpd_3.i [2024-10-11 18:02:18,745 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 18:02:18,745 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2024-10-11 18:02:18,781 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 18:02:18,787 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;@7cbdc02a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 18:02:18,787 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-10-11 18:02:18,791 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 54 states have internal predecessors, (62), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 18:02:18,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 18:02:18,797 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:02:18,798 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 18:02:18,799 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 18:02:18,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:02:18,804 INFO L85 PathProgramCache]: Analyzing trace with hash 131378568, now seen corresponding path program 1 times [2024-10-11 18:02:18,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:02:18,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [175627125] [2024-10-11 18:02:18,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:18,821 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 18:02:18,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:02:18,824 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 18:02:18,825 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 18:02:18,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:18,951 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 18:02:18,957 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:19,061 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 18:02:19,063 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:02:19,063 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:02:19,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [175627125] [2024-10-11 18:02:19,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [175627125] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:02:19,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:02:19,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 18:02:19,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033840579] [2024-10-11 18:02:19,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:02:19,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:02:19,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:02:19,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:02:19,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:02:19,099 INFO L87 Difference]: Start difference. First operand has 59 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 54 states have internal predecessors, (62), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:02:19,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:02:19,260 INFO L93 Difference]: Finished difference Result 106 states and 124 transitions. [2024-10-11 18:02:19,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:02:19,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 18:02:19,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:02:19,270 INFO L225 Difference]: With dead ends: 106 [2024-10-11 18:02:19,271 INFO L226 Difference]: Without dead ends: 104 [2024-10-11 18:02:19,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 18:02:19,276 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 50 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:02:19,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 96 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:02:19,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-11 18:02:19,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 81. [2024-10-11 18:02:19,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.7222222222222223) internal successors, (93), 73 states have internal predecessors, (93), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-11 18:02:19,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 106 transitions. [2024-10-11 18:02:19,315 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 106 transitions. Word has length 5 [2024-10-11 18:02:19,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:02:19,316 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 106 transitions. [2024-10-11 18:02:19,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:02:19,316 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 106 transitions. [2024-10-11 18:02:19,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 18:02:19,317 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:02:19,317 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 18:02:19,321 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 18:02:19,520 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 18:02:19,521 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 18:02:19,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:02:19,521 INFO L85 PathProgramCache]: Analyzing trace with hash 131378569, now seen corresponding path program 1 times [2024-10-11 18:02:19,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:02:19,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1537039261] [2024-10-11 18:02:19,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:19,522 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 18:02:19,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:02:19,528 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 18:02:19,529 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 18:02:19,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:19,606 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 18:02:19,607 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:19,712 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 18:02:19,713 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:02:19,714 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:02:19,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1537039261] [2024-10-11 18:02:19,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1537039261] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:02:19,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:02:19,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:02:19,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607683575] [2024-10-11 18:02:19,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:02:19,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:02:19,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:02:19,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:02:19,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:02:19,720 INFO L87 Difference]: Start difference. First operand 81 states and 106 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:02:19,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:02:19,923 INFO L93 Difference]: Finished difference Result 179 states and 235 transitions. [2024-10-11 18:02:19,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:02:19,925 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 18:02:19,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:02:19,926 INFO L225 Difference]: With dead ends: 179 [2024-10-11 18:02:19,928 INFO L226 Difference]: Without dead ends: 179 [2024-10-11 18:02:19,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 18:02:19,929 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 92 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:02:19,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 139 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:02:19,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-10-11 18:02:19,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 148. [2024-10-11 18:02:19,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 116 states have (on average 1.7672413793103448) internal successors, (205), 135 states have internal predecessors, (205), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2024-10-11 18:02:19,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 231 transitions. [2024-10-11 18:02:19,963 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 231 transitions. Word has length 5 [2024-10-11 18:02:19,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:02:19,964 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 231 transitions. [2024-10-11 18:02:19,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:02:19,967 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 231 transitions. [2024-10-11 18:02:19,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 18:02:19,968 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:02:19,968 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 18:02:19,971 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 18:02:20,169 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 18:02:20,169 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 18:02:20,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:02:20,170 INFO L85 PathProgramCache]: Analyzing trace with hash -222231707, now seen corresponding path program 1 times [2024-10-11 18:02:20,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:02:20,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [714721272] [2024-10-11 18:02:20,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:20,171 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 18:02:20,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:02:20,173 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 18:02:20,174 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 18:02:20,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:20,231 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 18:02:20,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:20,422 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 18:02:20,422 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:02:20,423 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:02:20,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [714721272] [2024-10-11 18:02:20,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [714721272] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:02:20,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:02:20,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:02:20,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177540378] [2024-10-11 18:02:20,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:02:20,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:02:20,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:02:20,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:02:20,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:02:20,425 INFO L87 Difference]: Start difference. First operand 148 states and 231 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:02:20,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:02:20,683 INFO L93 Difference]: Finished difference Result 193 states and 280 transitions. [2024-10-11 18:02:20,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:02:20,684 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-11 18:02:20,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:02:20,686 INFO L225 Difference]: With dead ends: 193 [2024-10-11 18:02:20,686 INFO L226 Difference]: Without dead ends: 193 [2024-10-11 18:02:20,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:02:20,689 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 79 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:02:20,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 155 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:02:20,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-10-11 18:02:20,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 151. [2024-10-11 18:02:20,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 119 states have (on average 1.7478991596638656) internal successors, (208), 138 states have internal predecessors, (208), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2024-10-11 18:02:20,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 234 transitions. [2024-10-11 18:02:20,712 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 234 transitions. Word has length 6 [2024-10-11 18:02:20,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:02:20,713 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 234 transitions. [2024-10-11 18:02:20,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:02:20,713 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 234 transitions. [2024-10-11 18:02:20,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 18:02:20,714 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:02:20,714 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:02:20,718 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 (4)] Forceful destruction successful, exit code 0 [2024-10-11 18:02:20,917 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 18:02:20,917 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 18:02:20,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:02:20,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1700751720, now seen corresponding path program 1 times [2024-10-11 18:02:20,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:02:20,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [174805280] [2024-10-11 18:02:20,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:20,919 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 18:02:20,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:02:20,923 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 18:02:20,927 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 18:02:20,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:20,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 18:02:20,997 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:21,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 18:02:21,193 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:02:21,193 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:02:21,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [174805280] [2024-10-11 18:02:21,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [174805280] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:02:21,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:02:21,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:02:21,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136123629] [2024-10-11 18:02:21,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:02:21,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:02:21,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:02:21,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:02:21,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:02:21,199 INFO L87 Difference]: Start difference. First operand 151 states and 234 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:02:21,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:02:21,450 INFO L93 Difference]: Finished difference Result 181 states and 236 transitions. [2024-10-11 18:02:21,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:02:21,451 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 18:02:21,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:02:21,452 INFO L225 Difference]: With dead ends: 181 [2024-10-11 18:02:21,452 INFO L226 Difference]: Without dead ends: 181 [2024-10-11 18:02:21,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:02:21,453 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 89 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 184 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.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:02:21,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 184 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:02:21,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-11 18:02:21,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 151. [2024-10-11 18:02:21,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 119 states have (on average 1.73109243697479) internal successors, (206), 138 states have internal predecessors, (206), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2024-10-11 18:02:21,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 232 transitions. [2024-10-11 18:02:21,465 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 232 transitions. Word has length 7 [2024-10-11 18:02:21,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:02:21,466 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 232 transitions. [2024-10-11 18:02:21,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:02:21,466 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 232 transitions. [2024-10-11 18:02:21,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 18:02:21,467 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:02:21,467 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:02:21,471 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 (5)] Ended with exit code 0 [2024-10-11 18:02:21,667 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 18:02:21,668 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 18:02:21,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:02:21,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1183695815, now seen corresponding path program 1 times [2024-10-11 18:02:21,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:02:21,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [518571893] [2024-10-11 18:02:21,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:21,669 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 18:02:21,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:02:21,672 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 18:02:21,673 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 18:02:21,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:21,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 18:02:21,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:21,776 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 18:02:21,777 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:02:21,777 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:02:21,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [518571893] [2024-10-11 18:02:21,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [518571893] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:02:21,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:02:21,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:02:21,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327404678] [2024-10-11 18:02:21,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:02:21,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:02:21,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:02:21,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:02:21,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:02:21,781 INFO L87 Difference]: Start difference. First operand 151 states and 232 transitions. Second operand has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:02:21,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:02:21,935 INFO L93 Difference]: Finished difference Result 233 states and 322 transitions. [2024-10-11 18:02:21,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:02:21,935 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-11 18:02:21,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:02:21,937 INFO L225 Difference]: With dead ends: 233 [2024-10-11 18:02:21,937 INFO L226 Difference]: Without dead ends: 233 [2024-10-11 18:02:21,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:02:21,938 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 130 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:02:21,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 184 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:02:21,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-10-11 18:02:21,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 184. [2024-10-11 18:02:21,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 150 states have (on average 1.68) internal successors, (252), 170 states have internal predecessors, (252), 8 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2024-10-11 18:02:21,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 278 transitions. [2024-10-11 18:02:21,950 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 278 transitions. Word has length 8 [2024-10-11 18:02:21,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:02:21,950 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 278 transitions. [2024-10-11 18:02:21,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:02:21,950 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 278 transitions. [2024-10-11 18:02:21,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 18:02:21,951 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:02:21,951 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:02:21,955 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 (6)] Ended with exit code 0 [2024-10-11 18:02:22,153 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 18:02:22,154 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 18:02:22,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:02:22,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1960135350, now seen corresponding path program 1 times [2024-10-11 18:02:22,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:02:22,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1510793722] [2024-10-11 18:02:22,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:22,155 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 18:02:22,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:02:22,157 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 18:02:22,158 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 18:02:22,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:22,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 18:02:22,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:22,300 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 18:02:22,301 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:02:22,301 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:02:22,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1510793722] [2024-10-11 18:02:22,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1510793722] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:02:22,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:02:22,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:02:22,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585176107] [2024-10-11 18:02:22,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:02:22,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:02:22,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:02:22,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:02:22,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:02:22,303 INFO L87 Difference]: Start difference. First operand 184 states and 278 transitions. Second operand has 5 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:02:22,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:02:22,459 INFO L93 Difference]: Finished difference Result 234 states and 301 transitions. [2024-10-11 18:02:22,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:02:22,460 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-11 18:02:22,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:02:22,461 INFO L225 Difference]: With dead ends: 234 [2024-10-11 18:02:22,462 INFO L226 Difference]: Without dead ends: 234 [2024-10-11 18:02:22,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:02:22,463 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 140 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:02:22,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 200 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:02:22,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-10-11 18:02:22,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 198. [2024-10-11 18:02:22,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 163 states have (on average 1.6748466257668713) internal successors, (273), 184 states have internal predecessors, (273), 8 states have call successors, (8), 5 states have call predecessors, (8), 7 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2024-10-11 18:02:22,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 299 transitions. [2024-10-11 18:02:22,476 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 299 transitions. Word has length 9 [2024-10-11 18:02:22,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:02:22,476 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 299 transitions. [2024-10-11 18:02:22,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:02:22,476 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 299 transitions. [2024-10-11 18:02:22,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 18:02:22,477 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:02:22,477 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:02:22,483 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 (7)] Forceful destruction successful, exit code 0 [2024-10-11 18:02:22,680 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 18:02:22,680 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 18:02:22,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:02:22,681 INFO L85 PathProgramCache]: Analyzing trace with hash -519071088, now seen corresponding path program 1 times [2024-10-11 18:02:22,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:02:22,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [507572872] [2024-10-11 18:02:22,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:22,681 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 18:02:22,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:02:22,682 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 18:02:22,683 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 18:02:22,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:22,745 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 18:02:22,748 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:22,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:02:22,914 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:02:23,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:02:23,169 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:02:23,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [507572872] [2024-10-11 18:02:23,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [507572872] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:02:23,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:02:23,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2024-10-11 18:02:23,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637596807] [2024-10-11 18:02:23,170 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:02:23,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 18:02:23,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:02:23,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 18:02:23,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:02:23,172 INFO L87 Difference]: Start difference. First operand 198 states and 299 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:02:23,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:02:23,519 INFO L93 Difference]: Finished difference Result 269 states and 356 transitions. [2024-10-11 18:02:23,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 18:02:23,520 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 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 18:02:23,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:02:23,522 INFO L225 Difference]: With dead ends: 269 [2024-10-11 18:02:23,522 INFO L226 Difference]: Without dead ends: 269 [2024-10-11 18:02:23,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:02:23,523 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 185 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:02:23,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 290 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:02:23,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-10-11 18:02:23,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 228. [2024-10-11 18:02:23,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 193 states have (on average 1.6632124352331605) internal successors, (321), 214 states have internal predecessors, (321), 8 states have call successors, (8), 5 states have call predecessors, (8), 7 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2024-10-11 18:02:23,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 347 transitions. [2024-10-11 18:02:23,534 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 347 transitions. Word has length 13 [2024-10-11 18:02:23,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:02:23,534 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 347 transitions. [2024-10-11 18:02:23,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:02:23,535 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 347 transitions. [2024-10-11 18:02:23,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 18:02:23,535 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:02:23,535 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:02:23,540 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 (8)] Ended with exit code 0 [2024-10-11 18:02:23,736 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 18:02:23,736 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 18:02:23,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:02:23,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1088665406, now seen corresponding path program 1 times [2024-10-11 18:02:23,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:02:23,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1272813484] [2024-10-11 18:02:23,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:23,737 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 18:02:23,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:02:23,744 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 18:02:23,746 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 18:02:23,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:23,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 18:02:23,809 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:24,010 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:02:24,011 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:02:24,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:02:24,128 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:02:24,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1272813484] [2024-10-11 18:02:24,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1272813484] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:02:24,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:02:24,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2024-10-11 18:02:24,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214098585] [2024-10-11 18:02:24,129 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:02:24,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 18:02:24,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:02:24,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 18:02:24,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:02:24,131 INFO L87 Difference]: Start difference. First operand 228 states and 347 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:02:24,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:02:24,557 INFO L93 Difference]: Finished difference Result 287 states and 413 transitions. [2024-10-11 18:02:24,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 18:02:24,558 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-11 18:02:24,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:02:24,560 INFO L225 Difference]: With dead ends: 287 [2024-10-11 18:02:24,560 INFO L226 Difference]: Without dead ends: 287 [2024-10-11 18:02:24,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-10-11 18:02:24,561 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 107 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:02:24,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 277 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 18:02:24,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-10-11 18:02:24,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 238. [2024-10-11 18:02:24,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 203 states have (on average 1.6551724137931034) internal successors, (336), 224 states have internal predecessors, (336), 8 states have call successors, (8), 5 states have call predecessors, (8), 7 states have return successors, (18), 8 states have call predecessors, (18), 8 states have call successors, (18) [2024-10-11 18:02:24,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 362 transitions. [2024-10-11 18:02:24,572 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 362 transitions. Word has length 14 [2024-10-11 18:02:24,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:02:24,572 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 362 transitions. [2024-10-11 18:02:24,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:02:24,572 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 362 transitions. [2024-10-11 18:02:24,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 18:02:24,573 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:02:24,573 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:02:24,579 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 18:02:24,773 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 18:02:24,774 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 18:02:24,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:02:24,775 INFO L85 PathProgramCache]: Analyzing trace with hash -611110737, now seen corresponding path program 1 times [2024-10-11 18:02:24,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:02:24,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1165616678] [2024-10-11 18:02:24,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:24,775 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 18:02:24,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:02:24,776 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 18:02:24,777 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 18:02:24,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:24,843 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 18:02:24,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:25,084 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:02:25,085 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:02:25,224 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:02:25,225 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:02:25,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1165616678] [2024-10-11 18:02:25,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1165616678] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:02:25,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:02:25,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2024-10-11 18:02:25,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094786110] [2024-10-11 18:02:25,226 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:02:25,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 18:02:25,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:02:25,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 18:02:25,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:02:25,227 INFO L87 Difference]: Start difference. First operand 238 states and 362 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:02:26,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:02:26,014 INFO L93 Difference]: Finished difference Result 394 states and 522 transitions. [2024-10-11 18:02:26,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 18:02:26,016 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 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 18:02:26,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:02:26,017 INFO L225 Difference]: With dead ends: 394 [2024-10-11 18:02:26,019 INFO L226 Difference]: Without dead ends: 394 [2024-10-11 18:02:26,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-10-11 18:02:26,020 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 267 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 18:02:26,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 480 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 18:02:26,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-10-11 18:02:26,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 306. [2024-10-11 18:02:26,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 268 states have (on average 1.664179104477612) internal successors, (446), 290 states have internal predecessors, (446), 9 states have call successors, (9), 6 states have call predecessors, (9), 9 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2024-10-11 18:02:26,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 478 transitions. [2024-10-11 18:02:26,035 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 478 transitions. Word has length 15 [2024-10-11 18:02:26,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:02:26,035 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 478 transitions. [2024-10-11 18:02:26,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:02:26,036 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 478 transitions. [2024-10-11 18:02:26,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 18:02:26,036 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:02:26,036 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:02:26,041 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 (10)] Forceful destruction successful, exit code 0 [2024-10-11 18:02:26,237 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 18:02:26,237 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting parse_inputErr10ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 18:02:26,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:02:26,238 INFO L85 PathProgramCache]: Analyzing trace with hash -905176023, now seen corresponding path program 1 times [2024-10-11 18:02:26,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:02:26,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [190361975] [2024-10-11 18:02:26,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:26,238 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 18:02:26,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:02:26,239 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 18:02:26,240 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 18:02:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:26,292 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 18:02:26,293 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:26,324 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 18:02:26,324 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:02:26,325 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:02:26,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [190361975] [2024-10-11 18:02:26,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [190361975] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:02:26,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:02:26,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 18:02:26,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591042022] [2024-10-11 18:02:26,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:02:26,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:02:26,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:02:26,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:02:26,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:02:26,326 INFO L87 Difference]: Start difference. First operand 306 states and 478 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:02:26,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:02:26,362 INFO L93 Difference]: Finished difference Result 447 states and 695 transitions. [2024-10-11 18:02:26,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:02:26,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-11 18:02:26,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:02:26,367 INFO L225 Difference]: With dead ends: 447 [2024-10-11 18:02:26,368 INFO L226 Difference]: Without dead ends: 447 [2024-10-11 18:02:26,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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 18:02:26,369 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 50 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:02:26,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 105 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:02:26,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2024-10-11 18:02:26,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 427. [2024-10-11 18:02:26,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 380 states have (on average 1.6605263157894736) internal successors, (631), 404 states have internal predecessors, (631), 13 states have call successors, (13), 9 states have call predecessors, (13), 14 states have return successors, (43), 13 states have call predecessors, (43), 13 states have call successors, (43) [2024-10-11 18:02:26,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 687 transitions. [2024-10-11 18:02:26,387 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 687 transitions. Word has length 16 [2024-10-11 18:02:26,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:02:26,387 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 687 transitions. [2024-10-11 18:02:26,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:02:26,388 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 687 transitions. [2024-10-11 18:02:26,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 18:02:26,388 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:02:26,388 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:02:26,392 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 18:02:26,589 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 18:02:26,589 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting parse_inputErr13ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 18:02:26,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:02:26,589 INFO L85 PathProgramCache]: Analyzing trace with hash -905175767, now seen corresponding path program 1 times [2024-10-11 18:02:26,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:02:26,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [364937814] [2024-10-11 18:02:26,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:26,590 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 18:02:26,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:02:26,591 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 18:02:26,592 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 18:02:26,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:26,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 18:02:26,638 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:26,705 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 18:02:26,706 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:02:26,706 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:02:26,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [364937814] [2024-10-11 18:02:26,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [364937814] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:02:26,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:02:26,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:02:26,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249946770] [2024-10-11 18:02:26,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:02:26,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:02:26,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:02:26,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:02:26,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:02:26,707 INFO L87 Difference]: Start difference. First operand 427 states and 687 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:02:26,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:02:26,754 INFO L93 Difference]: Finished difference Result 474 states and 734 transitions. [2024-10-11 18:02:26,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:02:26,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-11 18:02:26,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:02:26,757 INFO L225 Difference]: With dead ends: 474 [2024-10-11 18:02:26,757 INFO L226 Difference]: Without dead ends: 474 [2024-10-11 18:02:26,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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 18:02:26,757 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 35 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:02:26,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 104 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:02:26,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2024-10-11 18:02:26,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 458. [2024-10-11 18:02:26,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 408 states have (on average 1.642156862745098) internal successors, (670), 433 states have internal predecessors, (670), 14 states have call successors, (14), 10 states have call predecessors, (14), 16 states have return successors, (46), 14 states have call predecessors, (46), 14 states have call successors, (46) [2024-10-11 18:02:26,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 730 transitions. [2024-10-11 18:02:26,775 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 730 transitions. Word has length 16 [2024-10-11 18:02:26,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:02:26,775 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 730 transitions. [2024-10-11 18:02:26,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:02:26,775 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 730 transitions. [2024-10-11 18:02:26,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 18:02:26,776 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:02:26,776 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 18:02:26,780 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 (12)] Ended with exit code 0 [2024-10-11 18:02:26,976 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 18:02:26,977 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting parse_inputErr11ASSERT_VIOLATIONMEMORY_FREE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 18:02:26,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:02:26,978 INFO L85 PathProgramCache]: Analyzing trace with hash 2004314431, now seen corresponding path program 1 times [2024-10-11 18:02:26,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:02:26,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [296988963] [2024-10-11 18:02:26,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:26,978 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 18:02:26,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:02:26,979 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 18:02:26,980 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 18:02:27,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:27,030 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 18:02:27,032 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:27,095 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 18:02:27,095 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:02:27,095 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:02:27,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [296988963] [2024-10-11 18:02:27,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [296988963] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:02:27,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:02:27,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 18:02:27,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374210541] [2024-10-11 18:02:27,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:02:27,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:02:27,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:02:27,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:02:27,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:02:27,096 INFO L87 Difference]: Start difference. First operand 458 states and 730 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:02:27,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:02:27,148 INFO L93 Difference]: Finished difference Result 473 states and 730 transitions. [2024-10-11 18:02:27,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:02:27,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-11 18:02:27,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:02:27,150 INFO L225 Difference]: With dead ends: 473 [2024-10-11 18:02:27,150 INFO L226 Difference]: Without dead ends: 473 [2024-10-11 18:02:27,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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 18:02:27,151 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 32 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:02:27,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 104 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:02:27,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2024-10-11 18:02:27,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 458. [2024-10-11 18:02:27,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 408 states have (on average 1.6323529411764706) internal successors, (666), 433 states have internal predecessors, (666), 14 states have call successors, (14), 10 states have call predecessors, (14), 16 states have return successors, (46), 14 states have call predecessors, (46), 14 states have call successors, (46) [2024-10-11 18:02:27,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 726 transitions. [2024-10-11 18:02:27,164 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 726 transitions. Word has length 17 [2024-10-11 18:02:27,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:02:27,164 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 726 transitions. [2024-10-11 18:02:27,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:02:27,164 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 726 transitions. [2024-10-11 18:02:27,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 18:02:27,165 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:02:27,165 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2024-10-11 18:02:27,169 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 18:02:27,366 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 18:02:27,366 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 18:02:27,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:02:27,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1223463063, now seen corresponding path program 2 times [2024-10-11 18:02:27,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:02:27,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [530603743] [2024-10-11 18:02:27,367 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 18:02:27,367 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 18:02:27,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:02:27,370 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 18:02:27,371 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 18:02:27,425 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 18:02:27,425 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 18:02:27,427 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 18:02:27,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:27,644 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:02:27,644 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:02:28,091 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:02:28,091 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:02:28,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [530603743] [2024-10-11 18:02:28,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [530603743] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:02:28,091 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:02:28,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2024-10-11 18:02:28,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423232513] [2024-10-11 18:02:28,092 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:02:28,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 18:02:28,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:02:28,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 18:02:28,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:02:28,093 INFO L87 Difference]: Start difference. First operand 458 states and 726 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:02:28,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:02:28,785 INFO L93 Difference]: Finished difference Result 536 states and 816 transitions. [2024-10-11 18:02:28,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 18:02:28,787 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-11 18:02:28,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:02:28,789 INFO L225 Difference]: With dead ends: 536 [2024-10-11 18:02:28,789 INFO L226 Difference]: Without dead ends: 536 [2024-10-11 18:02:28,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-10-11 18:02:28,790 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 149 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 18:02:28,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 334 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 18:02:28,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2024-10-11 18:02:28,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 489. [2024-10-11 18:02:28,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 439 states have (on average 1.6309794988610478) internal successors, (716), 464 states have internal predecessors, (716), 14 states have call successors, (14), 10 states have call predecessors, (14), 16 states have return successors, (46), 14 states have call predecessors, (46), 14 states have call successors, (46) [2024-10-11 18:02:28,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 776 transitions. [2024-10-11 18:02:28,803 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 776 transitions. Word has length 21 [2024-10-11 18:02:28,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:02:28,803 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 776 transitions. [2024-10-11 18:02:28,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 18:02:28,804 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 776 transitions. [2024-10-11 18:02:28,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 18:02:28,805 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:02:28,805 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:02:28,809 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 18:02:29,008 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 18:02:29,008 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 18:02:29,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:02:29,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1348043702, now seen corresponding path program 1 times [2024-10-11 18:02:29,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:02:29,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1553481199] [2024-10-11 18:02:29,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:29,009 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 18:02:29,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:02:29,012 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 18:02:29,013 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 18:02:29,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:29,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 18:02:29,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:29,083 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:02:29,084 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:02:29,084 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:02:29,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1553481199] [2024-10-11 18:02:29,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1553481199] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:02:29,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:02:29,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:02:29,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40424300] [2024-10-11 18:02:29,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:02:29,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:02:29,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:02:29,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:02:29,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:02:29,086 INFO L87 Difference]: Start difference. First operand 489 states and 776 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:02:29,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:02:29,104 INFO L93 Difference]: Finished difference Result 342 states and 518 transitions. [2024-10-11 18:02:29,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:02:29,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-10-11 18:02:29,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:02:29,106 INFO L225 Difference]: With dead ends: 342 [2024-10-11 18:02:29,106 INFO L226 Difference]: Without dead ends: 342 [2024-10-11 18:02:29,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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 18:02:29,107 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 3 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 18:02:29,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 118 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 18:02:29,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-10-11 18:02:29,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 341. [2024-10-11 18:02:29,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 300 states have (on average 1.6033333333333333) internal successors, (481), 323 states have internal predecessors, (481), 10 states have call successors, (10), 7 states have call predecessors, (10), 11 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2024-10-11 18:02:29,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 517 transitions. [2024-10-11 18:02:29,116 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 517 transitions. Word has length 23 [2024-10-11 18:02:29,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:02:29,116 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 517 transitions. [2024-10-11 18:02:29,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:02:29,116 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 517 transitions. [2024-10-11 18:02:29,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 18:02:29,117 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:02:29,117 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:02:29,122 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 18:02:29,318 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 18:02:29,318 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 18:02:29,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:02:29,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1173620402, now seen corresponding path program 1 times [2024-10-11 18:02:29,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:02:29,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [361089960] [2024-10-11 18:02:29,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:29,319 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 18:02:29,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:02:29,320 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 18:02:29,321 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 18:02:29,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:29,393 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 18:02:29,396 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:29,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:02:29,696 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 18:02:29,756 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:02:29,756 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:02:30,005 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:02:30,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [361089960] [2024-10-11 18:02:30,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [361089960] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:02:30,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1919998137] [2024-10-11 18:02:30,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:30,006 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 18:02:30,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 18:02:30,009 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 18:02:30,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2024-10-11 18:02:30,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:30,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 18:02:30,199 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:30,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:02:30,437 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 18:02:30,472 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:02:30,472 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:02:30,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1919998137] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:02:30,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:02:30,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2024-10-11 18:02:30,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770345245] [2024-10-11 18:02:30,623 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:02:30,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:02:30,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:02:30,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:02:30,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-11 18:02:30,625 INFO L87 Difference]: Start difference. First operand 341 states and 517 transitions. Second operand has 7 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:02:31,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:02:31,164 INFO L93 Difference]: Finished difference Result 367 states and 513 transitions. [2024-10-11 18:02:31,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 18:02:31,165 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-10-11 18:02:31,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:02:31,167 INFO L225 Difference]: With dead ends: 367 [2024-10-11 18:02:31,167 INFO L226 Difference]: Without dead ends: 367 [2024-10-11 18:02:31,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2024-10-11 18:02:31,168 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 198 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:02:31,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 119 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 18:02:31,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-10-11 18:02:31,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 355. [2024-10-11 18:02:31,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 311 states have (on average 1.4887459807073955) internal successors, (463), 335 states have internal predecessors, (463), 11 states have call successors, (11), 8 states have call predecessors, (11), 15 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) [2024-10-11 18:02:31,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 506 transitions. [2024-10-11 18:02:31,177 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 506 transitions. Word has length 25 [2024-10-11 18:02:31,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:02:31,177 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 506 transitions. [2024-10-11 18:02:31,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:02:31,177 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 506 transitions. [2024-10-11 18:02:31,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 18:02:31,178 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:02:31,178 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:02:31,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Ended with exit code 0 [2024-10-11 18:02:31,384 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 (16)] Forceful destruction successful, exit code 0 [2024-10-11 18:02:31,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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 18:02:31,579 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 18:02:31,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:02:31,580 INFO L85 PathProgramCache]: Analyzing trace with hash -177446873, now seen corresponding path program 1 times [2024-10-11 18:02:31,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:02:31,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [791581282] [2024-10-11 18:02:31,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:31,580 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 18:02:31,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:02:31,581 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 18:02:31,583 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 18:02:31,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:31,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 18:02:31,650 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:31,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:02:31,760 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 18:02:31,760 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:02:31,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [791581282] [2024-10-11 18:02:31,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [791581282] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:02:31,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:02:31,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:02:31,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087428637] [2024-10-11 18:02:31,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:02:31,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:02:31,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:02:31,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:02:31,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:02:31,763 INFO L87 Difference]: Start difference. First operand 355 states and 506 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:02:31,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:02:31,842 INFO L93 Difference]: Finished difference Result 369 states and 516 transitions. [2024-10-11 18:02:31,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:02:31,843 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-10-11 18:02:31,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:02:31,845 INFO L225 Difference]: With dead ends: 369 [2024-10-11 18:02:31,845 INFO L226 Difference]: Without dead ends: 369 [2024-10-11 18:02:31,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 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 18:02:31,846 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 75 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:02:31,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 139 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 18:02:31,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-10-11 18:02:31,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 361. [2024-10-11 18:02:31,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 317 states have (on average 1.4794952681388012) internal successors, (469), 341 states have internal predecessors, (469), 11 states have call successors, (11), 8 states have call predecessors, (11), 15 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) [2024-10-11 18:02:31,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 512 transitions. [2024-10-11 18:02:31,855 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 512 transitions. Word has length 26 [2024-10-11 18:02:31,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:02:31,855 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 512 transitions. [2024-10-11 18:02:31,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:02:31,856 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 512 transitions. [2024-10-11 18:02:31,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 18:02:31,857 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:02:31,857 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:02:31,862 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 (18)] Forceful destruction successful, exit code 0 [2024-10-11 18:02:32,061 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 18:02:32,061 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 18:02:32,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:02:32,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1727191021, now seen corresponding path program 1 times [2024-10-11 18:02:32,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:02:32,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [7494937] [2024-10-11 18:02:32,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:32,062 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 18:02:32,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:02:32,064 INFO L229 MonitoredProcess]: Starting monitored process 19 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 18:02:32,064 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 (19)] Waiting until timeout for monitored process [2024-10-11 18:02:32,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:32,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 18:02:32,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:32,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:02:32,475 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 18:02:32,564 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:02:32,564 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:02:36,741 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:02:36,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [7494937] [2024-10-11 18:02:36,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [7494937] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:02:36,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [91535100] [2024-10-11 18:02:36,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:36,742 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 18:02:36,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 18:02:36,744 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 18:02:36,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2024-10-11 18:02:36,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:36,902 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 18:02:36,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:37,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:02:37,351 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 18:02:37,435 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:02:37,435 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:02:41,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [91535100] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:02:41,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:02:41,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 7 [2024-10-11 18:02:41,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954275984] [2024-10-11 18:02:41,616 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:02:41,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:02:41,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:02:41,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:02:41,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=123, Unknown=1, NotChecked=0, Total=156 [2024-10-11 18:02:41,618 INFO L87 Difference]: Start difference. First operand 361 states and 512 transitions. Second operand has 9 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:02:42,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:02:42,518 INFO L93 Difference]: Finished difference Result 370 states and 512 transitions. [2024-10-11 18:02:42,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 18:02:42,518 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-10-11 18:02:42,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:02:42,520 INFO L225 Difference]: With dead ends: 370 [2024-10-11 18:02:42,520 INFO L226 Difference]: Without dead ends: 370 [2024-10-11 18:02:42,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=143, Invalid=362, Unknown=1, NotChecked=0, Total=506 [2024-10-11 18:02:42,521 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 206 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 18:02:42,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 179 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 18:02:42,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2024-10-11 18:02:42,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 362. [2024-10-11 18:02:42,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 318 states have (on average 1.4622641509433962) internal successors, (465), 342 states have internal predecessors, (465), 11 states have call successors, (11), 8 states have call predecessors, (11), 15 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) [2024-10-11 18:02:42,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 508 transitions. [2024-10-11 18:02:42,531 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 508 transitions. Word has length 27 [2024-10-11 18:02:42,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:02:42,531 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 508 transitions. [2024-10-11 18:02:42,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 18:02:42,532 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 508 transitions. [2024-10-11 18:02:42,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 18:02:42,534 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:02:42,534 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:02:42,539 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 (19)] Ended with exit code 0 [2024-10-11 18:02:42,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2024-10-11 18:02:42,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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,20 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-11 18:02:42,935 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 18:02:42,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:02:42,936 INFO L85 PathProgramCache]: Analyzing trace with hash 2003314146, now seen corresponding path program 1 times [2024-10-11 18:02:42,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:02:42,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1691647738] [2024-10-11 18:02:42,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:42,936 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 18:02:42,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:02:42,937 INFO L229 MonitoredProcess]: Starting monitored process 21 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 18:02:42,938 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 (21)] Waiting until timeout for monitored process [2024-10-11 18:02:43,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:43,009 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 18:02:43,010 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:43,047 WARN L873 $PredicateComparison]: unable to prove that (exists ((|parse_input_c1_~x~0#1.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |parse_input_c1_~x~0#1.base| (_ bv1 1)))) is different from true [2024-10-11 18:02:43,087 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-11 18:02:43,088 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 18:02:43,169 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:02:43,169 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:02:43,430 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:02:43,430 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:02:43,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1691647738] [2024-10-11 18:02:43,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1691647738] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:02:43,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 18:02:43,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2024-10-11 18:02:43,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491029439] [2024-10-11 18:02:43,431 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 18:02:43,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 18:02:43,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 18:02:43,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 18:02:43,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=50, Unknown=1, NotChecked=14, Total=90 [2024-10-11 18:02:43,432 INFO L87 Difference]: Start difference. First operand 362 states and 508 transitions. Second operand has 10 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:02:44,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:02:44,078 INFO L93 Difference]: Finished difference Result 513 states and 661 transitions. [2024-10-11 18:02:44,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 18:02:44,079 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2024-10-11 18:02:44,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:02:44,081 INFO L225 Difference]: With dead ends: 513 [2024-10-11 18:02:44,081 INFO L226 Difference]: Without dead ends: 513 [2024-10-11 18:02:44,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=252, Unknown=8, NotChecked=36, Total=420 [2024-10-11 18:02:44,082 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 293 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 180 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:02:44,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 264 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 196 Invalid, 0 Unknown, 180 Unchecked, 0.4s Time] [2024-10-11 18:02:44,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2024-10-11 18:02:44,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 443. [2024-10-11 18:02:44,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 396 states have (on average 1.4141414141414141) internal successors, (560), 421 states have internal predecessors, (560), 11 states have call successors, (11), 10 states have call predecessors, (11), 18 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2024-10-11 18:02:44,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 602 transitions. [2024-10-11 18:02:44,098 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 602 transitions. Word has length 28 [2024-10-11 18:02:44,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:02:44,098 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 602 transitions. [2024-10-11 18:02:44,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 18:02:44,098 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 602 transitions. [2024-10-11 18:02:44,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 18:02:44,099 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:02:44,099 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:02:44,105 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 (21)] Ended with exit code 0 [2024-10-11 18:02:44,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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 18:02:44,300 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE === [parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2024-10-11 18:02:44,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:02:44,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1973196431, now seen corresponding path program 1 times [2024-10-11 18:02:44,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 18:02:44,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1696587805] [2024-10-11 18:02:44,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:44,301 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 18:02:44,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 18:02:44,302 INFO L229 MonitoredProcess]: Starting monitored process 22 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 18:02:44,303 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 (22)] Waiting until timeout for monitored process [2024-10-11 18:02:44,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:44,391 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 18:02:44,392 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:44,483 WARN L873 $PredicateComparison]: unable to prove that (exists ((|parse_input_c1_~x~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |parse_input_c1_~x~0#1.base| (select |c_#length| |parse_input_c1_~x~0#1.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |parse_input_c1_~x~0#1.base|)))) is different from true [2024-10-11 18:02:44,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:02:44,538 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 18:02:44,610 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:02:44,610 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:02:44,724 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 18:02:44,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1696587805] [2024-10-11 18:02:44,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1696587805] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:02:44,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [420001291] [2024-10-11 18:02:44,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:02:44,725 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 18:02:44,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 18:02:44,727 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 18:02:44,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2024-10-11 18:02:44,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:02:44,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 18:02:44,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:02:45,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:02:45,109 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 18:02:45,184 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 18:02:45,185 INFO L311 TraceCheckSpWp]: Computing backward predicates...