./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 fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6826aeecba49275836b6b398765a757158a4e84d2c6569399d77f2320562875e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 14:41:46,951 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 14:41:47,014 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-20 14:41:47,023 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 14:41:47,024 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 14:41:47,066 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 14:41:47,067 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 14:41:47,067 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 14:41:47,068 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 14:41:47,070 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 14:41:47,070 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 14:41:47,070 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 14:41:47,071 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 14:41:47,071 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 14:41:47,074 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 14:41:47,075 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 14:41:47,075 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 14:41:47,075 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 14:41:47,075 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 14:41:47,076 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 14:41:47,076 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 14:41:47,076 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 14:41:47,076 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-20 14:41:47,077 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 14:41:47,077 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 14:41:47,077 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 14:41:47,077 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 14:41:47,077 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 14:41:47,078 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 14:41:47,078 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 14:41:47,078 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 14:41:47,078 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 14:41:47,078 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 14:41:47,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 14:41:47,079 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 14:41:47,079 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 14:41:47,079 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 14:41:47,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 14:41:47,079 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 14:41:47,080 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 14:41:47,080 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 14:41:47,082 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 14:41:47,082 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6826aeecba49275836b6b398765a757158a4e84d2c6569399d77f2320562875e [2024-11-20 14:41:47,360 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 14:41:47,386 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 14:41:47,390 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 14:41:47,392 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 14:41:47,392 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 14:41:47,393 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_3.i [2024-11-20 14:41:48,872 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 14:41:49,106 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 14:41:49,107 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_3.i [2024-11-20 14:41:49,125 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fd2a49d2/96b9d5308c164ae99f5d81ce9d83893d/FLAGbb2a6c5cf [2024-11-20 14:41:49,445 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fd2a49d2/96b9d5308c164ae99f5d81ce9d83893d [2024-11-20 14:41:49,447 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 14:41:49,449 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 14:41:49,450 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 14:41:49,450 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 14:41:49,457 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 14:41:49,458 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:41:49" (1/1) ... [2024-11-20 14:41:49,459 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fb4f484 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:41:49, skipping insertion in model container [2024-11-20 14:41:49,459 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:41:49" (1/1) ... [2024-11-20 14:41:49,510 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 14:41:49,883 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:41:49,891 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 14:41:49,904 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 14:41:49,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 14:41:50,003 INFO L204 MainTranslator]: Completed translation [2024-11-20 14:41:50,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:41:50 WrapperNode [2024-11-20 14:41:50,005 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 14:41:50,006 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 14:41:50,007 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 14:41:50,007 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 14:41:50,012 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:41:50" (1/1) ... [2024-11-20 14:41:50,027 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:41:50" (1/1) ... [2024-11-20 14:41:50,055 INFO L138 Inliner]: procedures = 168, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 95 [2024-11-20 14:41:50,056 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 14:41:50,057 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 14:41:50,057 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 14:41:50,057 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 14:41:50,069 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:41:50" (1/1) ... [2024-11-20 14:41:50,070 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:41:50" (1/1) ... [2024-11-20 14:41:50,073 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:41:50" (1/1) ... [2024-11-20 14:41:50,100 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-11-20 14:41:50,101 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:41:50" (1/1) ... [2024-11-20 14:41:50,103 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:41:50" (1/1) ... [2024-11-20 14:41:50,112 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:41:50" (1/1) ... [2024-11-20 14:41:50,116 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:41:50" (1/1) ... [2024-11-20 14:41:50,119 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:41:50" (1/1) ... [2024-11-20 14:41:50,121 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:41:50" (1/1) ... [2024-11-20 14:41:50,127 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 14:41:50,128 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 14:41:50,129 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 14:41:50,129 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 14:41:50,130 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:41:50" (1/1) ... [2024-11-20 14:41:50,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 14:41:50,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:41:50,167 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 14:41:50,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 14:41:50,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-20 14:41:50,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-20 14:41:50,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-20 14:41:50,226 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2024-11-20 14:41:50,226 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2024-11-20 14:41:50,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-20 14:41:50,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 14:41:50,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-20 14:41:50,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-20 14:41:50,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-20 14:41:50,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 14:41:50,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-20 14:41:50,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-20 14:41:50,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-20 14:41:50,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 14:41:50,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-20 14:41:50,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-20 14:41:50,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 14:41:50,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 14:41:50,382 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 14:41:50,385 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 14:41:50,628 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-11-20 14:41:50,629 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 14:41:50,652 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 14:41:50,652 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 14:41:50,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:41:50 BoogieIcfgContainer [2024-11-20 14:41:50,654 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 14:41:50,656 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 14:41:50,657 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 14:41:50,659 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 14:41:50,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:41:49" (1/3) ... [2024-11-20 14:41:50,660 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17a55a8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:41:50, skipping insertion in model container [2024-11-20 14:41:50,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:41:50" (2/3) ... [2024-11-20 14:41:50,661 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17a55a8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:41:50, skipping insertion in model container [2024-11-20 14:41:50,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:41:50" (3/3) ... [2024-11-20 14:41:50,662 INFO L112 eAbstractionObserver]: Analyzing ICFG bftpd_3.i [2024-11-20 14:41:50,676 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 14:41:50,676 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2024-11-20 14:41:50,714 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 14:41:50,720 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;@1d075449, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 14:41:50,720 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-11-20 14:41:50,725 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 57 states have internal predecessors, (65), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 14:41:50,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-20 14:41:50,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:41:50,730 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-20 14:41:50,731 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-11-20 14:41:50,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:41:50,737 INFO L85 PathProgramCache]: Analyzing trace with hash -742866944, now seen corresponding path program 1 times [2024-11-20 14:41:50,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:41:50,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168113321] [2024-11-20 14:41:50,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:41:50,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:41:50,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:41:51,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-11-20 14:41:51,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:41:51,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168113321] [2024-11-20 14:41:51,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168113321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:41:51,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:41:51,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:41:51,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038418248] [2024-11-20 14:41:51,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:41:51,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:41:51,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:41:51,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:41:51,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:41:51,165 INFO L87 Difference]: Start difference. First operand has 62 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 57 states have internal predecessors, (65), 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, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:41:51,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:41:51,345 INFO L93 Difference]: Finished difference Result 123 states and 144 transitions. [2024-11-20 14:41:51,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:41:51,347 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-20 14:41:51,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:41:51,353 INFO L225 Difference]: With dead ends: 123 [2024-11-20 14:41:51,354 INFO L226 Difference]: Without dead ends: 117 [2024-11-20 14:41:51,355 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-11-20 14:41:51,358 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 105 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:41:51,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 119 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:41:51,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-20 14:41:51,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 90. [2024-11-20 14:41:51,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 63 states have (on average 1.619047619047619) internal successors, (102), 80 states have internal predecessors, (102), 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-11-20 14:41:51,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 120 transitions. [2024-11-20 14:41:51,397 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 120 transitions. Word has length 6 [2024-11-20 14:41:51,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:41:51,397 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 120 transitions. [2024-11-20 14:41:51,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:41:51,398 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 120 transitions. [2024-11-20 14:41:51,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-20 14:41:51,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:41:51,399 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-20 14:41:51,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 14:41:51,399 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-11-20 14:41:51,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:41:51,400 INFO L85 PathProgramCache]: Analyzing trace with hash -742866943, now seen corresponding path program 1 times [2024-11-20 14:41:51,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:41:51,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037319619] [2024-11-20 14:41:51,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:41:51,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:41:51,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:41:51,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:41:51,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:41:51,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037319619] [2024-11-20 14:41:51,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037319619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:41:51,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:41:51,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:41:51,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113231667] [2024-11-20 14:41:51,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:41:51,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:41:51,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:41:51,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:41:51,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:41:51,631 INFO L87 Difference]: Start difference. First operand 90 states and 120 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:41:51,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:41:51,798 INFO L93 Difference]: Finished difference Result 191 states and 255 transitions. [2024-11-20 14:41:51,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:41:51,799 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-20 14:41:51,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:41:51,801 INFO L225 Difference]: With dead ends: 191 [2024-11-20 14:41:51,801 INFO L226 Difference]: Without dead ends: 191 [2024-11-20 14:41:51,801 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-11-20 14:41:51,803 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 89 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:41:51,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 200 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:41:51,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-20 14:41:51,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 165. [2024-11-20 14:41:51,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 131 states have (on average 1.6412213740458015) internal successors, (215), 148 states have internal predecessors, (215), 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-11-20 14:41:51,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 251 transitions. [2024-11-20 14:41:51,822 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 251 transitions. Word has length 6 [2024-11-20 14:41:51,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:41:51,822 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 251 transitions. [2024-11-20 14:41:51,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:41:51,823 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 251 transitions. [2024-11-20 14:41:51,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-20 14:41:51,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:41:51,823 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:41:51,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 14:41:51,823 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-11-20 14:41:51,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:41:51,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1554038803, now seen corresponding path program 1 times [2024-11-20 14:41:51,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:41:51,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246428408] [2024-11-20 14:41:51,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:41:51,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:41:51,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:41:52,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:41:52,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:41:52,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246428408] [2024-11-20 14:41:52,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246428408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:41:52,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:41:52,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:41:52,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495688478] [2024-11-20 14:41:52,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:41:52,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:41:52,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:41:52,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:41:52,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:41:52,044 INFO L87 Difference]: Start difference. First operand 165 states and 251 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-11-20 14:41:52,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:41:52,214 INFO L93 Difference]: Finished difference Result 210 states and 300 transitions. [2024-11-20 14:41:52,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:41:52,215 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-11-20 14:41:52,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:41:52,217 INFO L225 Difference]: With dead ends: 210 [2024-11-20 14:41:52,218 INFO L226 Difference]: Without dead ends: 210 [2024-11-20 14:41:52,218 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-11-20 14:41:52,219 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 67 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:41:52,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 170 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:41:52,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-20 14:41:52,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 168. [2024-11-20 14:41:52,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 134 states have (on average 1.626865671641791) internal successors, (218), 151 states have internal predecessors, (218), 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-11-20 14:41:52,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 254 transitions. [2024-11-20 14:41:52,249 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 254 transitions. Word has length 7 [2024-11-20 14:41:52,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:41:52,250 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 254 transitions. [2024-11-20 14:41:52,250 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-11-20 14:41:52,250 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 254 transitions. [2024-11-20 14:41:52,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-20 14:41:52,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:41:52,265 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:41:52,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 14:41:52,267 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-11-20 14:41:52,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:41:52,268 INFO L85 PathProgramCache]: Analyzing trace with hash -930562592, now seen corresponding path program 1 times [2024-11-20 14:41:52,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:41:52,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677428623] [2024-11-20 14:41:52,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:41:52,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:41:52,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:41:52,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:41:52,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:41:52,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677428623] [2024-11-20 14:41:52,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677428623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:41:52,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:41:52,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:41:52,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734484092] [2024-11-20 14:41:52,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:41:52,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:41:52,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:41:52,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:41:52,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:41:52,533 INFO L87 Difference]: Start difference. First operand 168 states and 254 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 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-11-20 14:41:52,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:41:52,669 INFO L93 Difference]: Finished difference Result 193 states and 256 transitions. [2024-11-20 14:41:52,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:41:52,670 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 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-11-20 14:41:52,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:41:52,672 INFO L225 Difference]: With dead ends: 193 [2024-11-20 14:41:52,673 INFO L226 Difference]: Without dead ends: 193 [2024-11-20 14:41:52,673 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-11-20 14:41:52,676 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 70 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:41:52,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 195 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:41:52,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-20 14:41:52,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 168. [2024-11-20 14:41:52,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 134 states have (on average 1.6119402985074627) internal successors, (216), 151 states have internal predecessors, (216), 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-11-20 14:41:52,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 252 transitions. [2024-11-20 14:41:52,698 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 252 transitions. Word has length 8 [2024-11-20 14:41:52,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:41:52,698 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 252 transitions. [2024-11-20 14:41:52,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 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-11-20 14:41:52,699 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 252 transitions. [2024-11-20 14:41:52,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-20 14:41:52,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:41:52,699 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:41:52,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 14:41:52,701 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-11-20 14:41:52,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:41:52,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1217330767, now seen corresponding path program 1 times [2024-11-20 14:41:52,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:41:52,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024727208] [2024-11-20 14:41:52,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:41:52,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:41:52,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:41:52,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:41:52,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:41:52,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024727208] [2024-11-20 14:41:52,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024727208] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:41:52,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:41:52,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:41:52,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251644666] [2024-11-20 14:41:52,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:41:52,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:41:52,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:41:52,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:41:52,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:41:52,776 INFO L87 Difference]: Start difference. First operand 168 states and 252 transitions. Second operand has 5 states, 4 states have (on average 2.0) 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-11-20 14:41:52,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:41:52,885 INFO L93 Difference]: Finished difference Result 251 states and 343 transitions. [2024-11-20 14:41:52,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:41:52,886 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) 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-11-20 14:41:52,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:41:52,887 INFO L225 Difference]: With dead ends: 251 [2024-11-20 14:41:52,888 INFO L226 Difference]: Without dead ends: 251 [2024-11-20 14:41:52,889 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-11-20 14:41:52,890 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 133 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:41:52,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 188 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:41:52,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-11-20 14:41:52,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 202. [2024-11-20 14:41:52,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 166 states have (on average 1.5843373493975903) internal successors, (263), 184 states have internal predecessors, (263), 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-11-20 14:41:52,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 299 transitions. [2024-11-20 14:41:52,916 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 299 transitions. Word has length 9 [2024-11-20 14:41:52,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:41:52,916 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 299 transitions. [2024-11-20 14:41:52,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) 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-11-20 14:41:52,917 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 299 transitions. [2024-11-20 14:41:52,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-20 14:41:52,917 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:41:52,917 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:41:52,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 14:41:52,919 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-11-20 14:41:52,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:41:52,920 INFO L85 PathProgramCache]: Analyzing trace with hash -917451838, now seen corresponding path program 1 times [2024-11-20 14:41:52,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:41:52,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882008298] [2024-11-20 14:41:52,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:41:52,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:41:52,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:41:53,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:41:53,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:41:53,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882008298] [2024-11-20 14:41:53,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882008298] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:41:53,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:41:53,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:41:53,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568297089] [2024-11-20 14:41:53,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:41:53,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:41:53,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:41:53,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:41:53,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:41:53,016 INFO L87 Difference]: Start difference. First operand 202 states and 299 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:41:53,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:41:53,114 INFO L93 Difference]: Finished difference Result 250 states and 322 transitions. [2024-11-20 14:41:53,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:41:53,115 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 10 [2024-11-20 14:41:53,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:41:53,116 INFO L225 Difference]: With dead ends: 250 [2024-11-20 14:41:53,117 INFO L226 Difference]: Without dead ends: 250 [2024-11-20 14:41:53,117 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-11-20 14:41:53,118 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 187 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:41:53,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 201 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:41:53,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-11-20 14:41:53,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 216. [2024-11-20 14:41:53,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 179 states have (on average 1.5865921787709498) internal successors, (284), 198 states have internal predecessors, (284), 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-11-20 14:41:53,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 320 transitions. [2024-11-20 14:41:53,136 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 320 transitions. Word has length 10 [2024-11-20 14:41:53,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:41:53,136 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 320 transitions. [2024-11-20 14:41:53,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:41:53,136 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 320 transitions. [2024-11-20 14:41:53,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-20 14:41:53,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:41:53,137 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:41:53,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 14:41:53,137 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-11-20 14:41:53,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:41:53,139 INFO L85 PathProgramCache]: Analyzing trace with hash -657083128, now seen corresponding path program 1 times [2024-11-20 14:41:53,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:41:53,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587881849] [2024-11-20 14:41:53,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:41:53,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:41:53,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:41:53,341 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:41:53,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:41:53,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587881849] [2024-11-20 14:41:53,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587881849] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:41:53,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460749289] [2024-11-20 14:41:53,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:41:53,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:41:53,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:41:53,345 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:41:53,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 14:41:53,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:41:53,427 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-20 14:41:53,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:41:53,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:41:53,662 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:41:53,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:41:53,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460749289] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:41:53,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:41:53,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 11 [2024-11-20 14:41:53,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163179279] [2024-11-20 14:41:53,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:41:53,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 14:41:53,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:41:53,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 14:41:53,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-11-20 14:41:53,788 INFO L87 Difference]: Start difference. First operand 216 states and 320 transitions. Second operand has 13 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 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-11-20 14:41:53,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:41:53,990 INFO L93 Difference]: Finished difference Result 242 states and 319 transitions. [2024-11-20 14:41:53,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 14:41:53,990 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 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-11-20 14:41:53,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:41:53,992 INFO L225 Difference]: With dead ends: 242 [2024-11-20 14:41:53,992 INFO L226 Difference]: Without dead ends: 242 [2024-11-20 14:41:53,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-11-20 14:41:53,993 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 198 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:41:53,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 374 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:41:53,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-11-20 14:41:54,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 219. [2024-11-20 14:41:54,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 182 states have (on average 1.5274725274725274) internal successors, (278), 201 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-11-20 14:41:54,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 314 transitions. [2024-11-20 14:41:54,007 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 314 transitions. Word has length 14 [2024-11-20 14:41:54,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:41:54,008 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 314 transitions. [2024-11-20 14:41:54,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.25) internal successors, (39), 11 states have internal predecessors, (39), 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-11-20 14:41:54,008 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 314 transitions. [2024-11-20 14:41:54,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-20 14:41:54,009 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:41:54,009 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:41:54,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-20 14:41:54,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:41:54,210 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-11-20 14:41:54,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:41:54,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1105259462, now seen corresponding path program 1 times [2024-11-20 14:41:54,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:41:54,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926953120] [2024-11-20 14:41:54,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:41:54,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:41:54,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:41:54,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:41:54,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:41:54,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926953120] [2024-11-20 14:41:54,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926953120] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:41:54,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340403693] [2024-11-20 14:41:54,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:41:54,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:41:54,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:41:54,384 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:41:54,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 14:41:54,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:41:54,459 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-20 14:41:54,460 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:41:54,639 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:41:54,639 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:41:54,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:41:54,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340403693] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:41:54,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:41:54,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2024-11-20 14:41:54,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665565089] [2024-11-20 14:41:54,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:41:54,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 14:41:54,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:41:54,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 14:41:54,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-20 14:41:54,708 INFO L87 Difference]: Start difference. First operand 219 states and 314 transitions. Second operand has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 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-11-20 14:41:54,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:41:54,978 INFO L93 Difference]: Finished difference Result 262 states and 359 transitions. [2024-11-20 14:41:54,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 14:41:54,979 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 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-11-20 14:41:54,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:41:54,982 INFO L225 Difference]: With dead ends: 262 [2024-11-20 14:41:54,982 INFO L226 Difference]: Without dead ends: 262 [2024-11-20 14:41:54,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 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-11-20 14:41:54,983 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 116 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:41:54,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 353 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:41:54,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-11-20 14:41:54,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 227. [2024-11-20 14:41:54,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 190 states have (on average 1.5210526315789474) internal successors, (289), 209 states have internal predecessors, (289), 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-11-20 14:41:54,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 325 transitions. [2024-11-20 14:41:54,999 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 325 transitions. Word has length 15 [2024-11-20 14:41:54,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:41:54,999 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 325 transitions. [2024-11-20 14:41:55,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 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-11-20 14:41:55,000 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 325 transitions. [2024-11-20 14:41:55,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-20 14:41:55,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:41:55,000 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:41:55,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-20 14:41:55,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-20 14:41:55,201 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-11-20 14:41:55,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:41:55,202 INFO L85 PathProgramCache]: Analyzing trace with hash -96695001, now seen corresponding path program 1 times [2024-11-20 14:41:55,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:41:55,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627371000] [2024-11-20 14:41:55,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:41:55,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:41:55,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:41:55,421 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:41:55,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:41:55,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627371000] [2024-11-20 14:41:55,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627371000] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:41:55,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112608299] [2024-11-20 14:41:55,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:41:55,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:41:55,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:41:55,424 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:41:55,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-20 14:41:55,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:41:55,483 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-20 14:41:55,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:41:55,712 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:41:55,712 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:41:55,843 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:41:55,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112608299] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:41:55,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:41:55,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2024-11-20 14:41:55,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568063526] [2024-11-20 14:41:55,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:41:55,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-20 14:41:55,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:41:55,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-20 14:41:55,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-11-20 14:41:55,845 INFO L87 Difference]: Start difference. First operand 227 states and 325 transitions. Second operand has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 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-11-20 14:41:56,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:41:56,354 INFO L93 Difference]: Finished difference Result 362 states and 478 transitions. [2024-11-20 14:41:56,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 14:41:56,355 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 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 16 [2024-11-20 14:41:56,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:41:56,357 INFO L225 Difference]: With dead ends: 362 [2024-11-20 14:41:56,357 INFO L226 Difference]: Without dead ends: 362 [2024-11-20 14:41:56,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 23 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-11-20 14:41:56,358 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 305 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:41:56,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 623 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 14:41:56,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-11-20 14:41:56,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 299. [2024-11-20 14:41:56,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 258 states have (on average 1.5426356589147288) internal successors, (398), 279 states have internal predecessors, (398), 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-11-20 14:41:56,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 441 transitions. [2024-11-20 14:41:56,370 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 441 transitions. Word has length 16 [2024-11-20 14:41:56,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:41:56,370 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 441 transitions. [2024-11-20 14:41:56,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 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-11-20 14:41:56,370 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 441 transitions. [2024-11-20 14:41:56,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-20 14:41:56,371 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:41:56,372 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:41:56,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-20 14:41:56,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:41:56,573 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-11-20 14:41:56,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:41:56,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1930496567, now seen corresponding path program 1 times [2024-11-20 14:41:56,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:41:56,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967595595] [2024-11-20 14:41:56,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:41:56,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:41:56,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:41:56,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:41:56,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:41:56,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967595595] [2024-11-20 14:41:56,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967595595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:41:56,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:41:56,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-20 14:41:56,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255730779] [2024-11-20 14:41:56,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:41:56,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:41:56,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:41:56,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:41:56,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:41:56,639 INFO L87 Difference]: Start difference. First operand 299 states and 441 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:41:56,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:41:56,662 INFO L93 Difference]: Finished difference Result 438 states and 652 transitions. [2024-11-20 14:41:56,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:41:56,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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 18 [2024-11-20 14:41:56,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:41:56,665 INFO L225 Difference]: With dead ends: 438 [2024-11-20 14:41:56,665 INFO L226 Difference]: Without dead ends: 438 [2024-11-20 14:41:56,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:41:56,669 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 48 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:41:56,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 105 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:41:56,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-11-20 14:41:56,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 421. [2024-11-20 14:41:56,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 371 states have (on average 1.5498652291105122) internal successors, (575), 394 states have internal predecessors, (575), 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-11-20 14:41:56,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 644 transitions. [2024-11-20 14:41:56,688 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 644 transitions. Word has length 18 [2024-11-20 14:41:56,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:41:56,688 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 644 transitions. [2024-11-20 14:41:56,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:41:56,689 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 644 transitions. [2024-11-20 14:41:56,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-20 14:41:56,689 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:41:56,689 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:41:56,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 14:41:56,690 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-11-20 14:41:56,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:41:56,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1930496311, now seen corresponding path program 1 times [2024-11-20 14:41:56,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:41:56,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342160446] [2024-11-20 14:41:56,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:41:56,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:41:56,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:41:56,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:41:56,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:41:56,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342160446] [2024-11-20 14:41:56,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342160446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:41:56,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:41:56,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:41:56,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529055326] [2024-11-20 14:41:56,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:41:56,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:41:56,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:41:56,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:41:56,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:41:56,741 INFO L87 Difference]: Start difference. First operand 421 states and 644 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:41:56,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:41:56,749 INFO L93 Difference]: Finished difference Result 383 states and 578 transitions. [2024-11-20 14:41:56,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:41:56,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 18 [2024-11-20 14:41:56,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:41:56,752 INFO L225 Difference]: With dead ends: 383 [2024-11-20 14:41:56,752 INFO L226 Difference]: Without dead ends: 383 [2024-11-20 14:41:56,753 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-11-20 14:41:56,754 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:41:56,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:41:56,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-11-20 14:41:56,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2024-11-20 14:41:56,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 339 states have (on average 1.5014749262536873) internal successors, (509), 356 states have internal predecessors, (509), 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-11-20 14:41:56,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 578 transitions. [2024-11-20 14:41:56,772 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 578 transitions. Word has length 18 [2024-11-20 14:41:56,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:41:56,772 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 578 transitions. [2024-11-20 14:41:56,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:41:56,773 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 578 transitions. [2024-11-20 14:41:56,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-20 14:41:56,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:41:56,775 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:41:56,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 14:41:56,775 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-11-20 14:41:56,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:41:56,776 INFO L85 PathProgramCache]: Analyzing trace with hash 284148639, now seen corresponding path program 1 times [2024-11-20 14:41:56,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:41:56,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3418877] [2024-11-20 14:41:56,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:41:56,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:41:56,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:41:56,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:41:56,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:41:56,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3418877] [2024-11-20 14:41:56,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3418877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:41:56,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:41:56,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-20 14:41:56,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252587246] [2024-11-20 14:41:56,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:41:56,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:41:56,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:41:56,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:41:56,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:41:56,846 INFO L87 Difference]: Start difference. First operand 383 states and 578 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:41:56,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:41:56,879 INFO L93 Difference]: Finished difference Result 450 states and 659 transitions. [2024-11-20 14:41:56,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:41:56,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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 19 [2024-11-20 14:41:56,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:41:56,882 INFO L225 Difference]: With dead ends: 450 [2024-11-20 14:41:56,883 INFO L226 Difference]: Without dead ends: 450 [2024-11-20 14:41:56,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:41:56,883 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 31 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:41:56,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 89 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:41:56,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2024-11-20 14:41:56,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 433. [2024-11-20 14:41:56,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 385 states have (on average 1.4961038961038962) internal successors, (576), 404 states have internal predecessors, (576), 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-11-20 14:41:56,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 649 transitions. [2024-11-20 14:41:56,898 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 649 transitions. Word has length 19 [2024-11-20 14:41:56,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:41:56,898 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 649 transitions. [2024-11-20 14:41:56,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:41:56,899 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 649 transitions. [2024-11-20 14:41:56,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-20 14:41:56,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:41:56,899 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-11-20 14:41:56,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 14:41:56,900 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-11-20 14:41:56,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:41:56,900 INFO L85 PathProgramCache]: Analyzing trace with hash 373919402, now seen corresponding path program 1 times [2024-11-20 14:41:56,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:41:56,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796527268] [2024-11-20 14:41:56,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:41:56,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:41:56,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:41:56,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 14:41:56,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:41:56,984 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:41:56,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:41:56,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796527268] [2024-11-20 14:41:56,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796527268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:41:56,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:41:56,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:41:56,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008153399] [2024-11-20 14:41:56,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:41:56,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:41:56,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:41:56,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:41:56,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:41:56,989 INFO L87 Difference]: Start difference. First operand 433 states and 649 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 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-11-20 14:41:57,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:41:57,058 INFO L93 Difference]: Finished difference Result 308 states and 435 transitions. [2024-11-20 14:41:57,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:41:57,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 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-11-20 14:41:57,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:41:57,062 INFO L225 Difference]: With dead ends: 308 [2024-11-20 14:41:57,062 INFO L226 Difference]: Without dead ends: 308 [2024-11-20 14:41:57,063 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-11-20 14:41:57,063 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 36 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:41:57,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 60 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:41:57,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-11-20 14:41:57,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 302. [2024-11-20 14:41:57,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 264 states have (on average 1.4621212121212122) internal successors, (386), 282 states have internal predecessors, (386), 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-11-20 14:41:57,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 429 transitions. [2024-11-20 14:41:57,075 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 429 transitions. Word has length 25 [2024-11-20 14:41:57,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:41:57,075 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 429 transitions. [2024-11-20 14:41:57,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 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-11-20 14:41:57,076 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 429 transitions. [2024-11-20 14:41:57,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-20 14:41:57,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:41:57,078 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, 1] [2024-11-20 14:41:57,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 14:41:57,078 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-11-20 14:41:57,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:41:57,079 INFO L85 PathProgramCache]: Analyzing trace with hash 463540592, now seen corresponding path program 1 times [2024-11-20 14:41:57,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:41:57,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073715819] [2024-11-20 14:41:57,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:41:57,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:41:57,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:41:57,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 14:41:57,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:41:57,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:41:57,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:41:57,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073715819] [2024-11-20 14:41:57,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073715819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:41:57,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:41:57,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:41:57,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045196254] [2024-11-20 14:41:57,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:41:57,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 14:41:57,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:41:57,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 14:41:57,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:41:57,203 INFO L87 Difference]: Start difference. First operand 302 states and 429 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 4 states have internal predecessors, (24), 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-11-20 14:41:57,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:41:57,373 INFO L93 Difference]: Finished difference Result 321 states and 443 transitions. [2024-11-20 14:41:57,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 14:41:57,374 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 4 states have internal predecessors, (24), 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-11-20 14:41:57,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:41:57,376 INFO L225 Difference]: With dead ends: 321 [2024-11-20 14:41:57,376 INFO L226 Difference]: Without dead ends: 321 [2024-11-20 14:41:57,376 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-11-20 14:41:57,377 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 106 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:41:57,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 130 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:41:57,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-11-20 14:41:57,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 302. [2024-11-20 14:41:57,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 264 states have (on average 1.4507575757575757) internal successors, (383), 282 states have internal predecessors, (383), 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-11-20 14:41:57,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 426 transitions. [2024-11-20 14:41:57,386 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 426 transitions. Word has length 27 [2024-11-20 14:41:57,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:41:57,386 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 426 transitions. [2024-11-20 14:41:57,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 4 states have internal predecessors, (24), 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-11-20 14:41:57,387 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 426 transitions. [2024-11-20 14:41:57,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-20 14:41:57,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:41:57,391 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, 1] [2024-11-20 14:41:57,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 14:41:57,391 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-11-20 14:41:57,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:41:57,392 INFO L85 PathProgramCache]: Analyzing trace with hash 70513582, now seen corresponding path program 1 times [2024-11-20 14:41:57,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:41:57,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434560149] [2024-11-20 14:41:57,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:41:57,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:41:57,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:41:57,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 14:41:57,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:41:57,687 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:41:57,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:41:57,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434560149] [2024-11-20 14:41:57,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434560149] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:41:57,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707678405] [2024-11-20 14:41:57,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:41:57,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:41:57,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:41:57,691 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:41:57,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-20 14:41:57,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:41:57,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-20 14:41:57,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:41:58,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:41:58,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-20 14:41:58,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:41:58,121 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:41:58,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707678405] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:41:58,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:41:58,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 13 [2024-11-20 14:41:58,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271550267] [2024-11-20 14:41:58,281 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:41:58,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-20 14:41:58,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:41:58,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-20 14:41:58,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2024-11-20 14:41:58,283 INFO L87 Difference]: Start difference. First operand 302 states and 426 transitions. Second operand has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 11 states have internal predecessors, (48), 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-11-20 14:41:58,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:41:58,754 INFO L93 Difference]: Finished difference Result 318 states and 427 transitions. [2024-11-20 14:41:58,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 14:41:58,755 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 11 states have internal predecessors, (48), 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 27 [2024-11-20 14:41:58,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:41:58,756 INFO L225 Difference]: With dead ends: 318 [2024-11-20 14:41:58,756 INFO L226 Difference]: Without dead ends: 318 [2024-11-20 14:41:58,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 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-11-20 14:41:58,757 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 383 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:41:58,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 87 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:41:58,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-11-20 14:41:58,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 306. [2024-11-20 14:41:58,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 268 states have (on average 1.4067164179104477) internal successors, (377), 286 states have internal predecessors, (377), 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-11-20 14:41:58,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 420 transitions. [2024-11-20 14:41:58,770 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 420 transitions. Word has length 27 [2024-11-20 14:41:58,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:41:58,770 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 420 transitions. [2024-11-20 14:41:58,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 11 states have internal predecessors, (48), 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-11-20 14:41:58,771 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 420 transitions. [2024-11-20 14:41:58,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-20 14:41:58,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:41:58,773 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, 1, 1] [2024-11-20 14:41:58,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-20 14:41:58,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-20 14:41:58,977 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-11-20 14:41:58,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:41:58,977 INFO L85 PathProgramCache]: Analyzing trace with hash -263999033, now seen corresponding path program 1 times [2024-11-20 14:41:58,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:41:58,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499738234] [2024-11-20 14:41:58,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:41:58,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:41:58,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:41:59,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 14:41:59,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:41:59,160 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:41:59,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:41:59,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499738234] [2024-11-20 14:41:59,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499738234] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:41:59,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672935873] [2024-11-20 14:41:59,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:41:59,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:41:59,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:41:59,164 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:41:59,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-20 14:41:59,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:41:59,229 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-20 14:41:59,230 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:41:59,357 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:41:59,358 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:41:59,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672935873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:41:59,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 14:41:59,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 11 [2024-11-20 14:41:59,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248527379] [2024-11-20 14:41:59,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:41:59,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 14:41:59,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:41:59,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 14:41:59,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-20 14:41:59,360 INFO L87 Difference]: Start difference. First operand 306 states and 420 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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-11-20 14:41:59,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:41:59,423 INFO L93 Difference]: Finished difference Result 327 states and 437 transitions. [2024-11-20 14:41:59,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 14:41:59,424 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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 28 [2024-11-20 14:41:59,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:41:59,426 INFO L225 Difference]: With dead ends: 327 [2024-11-20 14:41:59,426 INFO L226 Difference]: Without dead ends: 327 [2024-11-20 14:41:59,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-20 14:41:59,427 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 56 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:41:59,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 137 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:41:59,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-11-20 14:41:59,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 317. [2024-11-20 14:41:59,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 279 states have (on average 1.3906810035842294) internal successors, (388), 297 states have internal predecessors, (388), 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-11-20 14:41:59,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 431 transitions. [2024-11-20 14:41:59,436 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 431 transitions. Word has length 28 [2024-11-20 14:41:59,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:41:59,436 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 431 transitions. [2024-11-20 14:41:59,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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-11-20 14:41:59,437 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 431 transitions. [2024-11-20 14:41:59,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-20 14:41:59,438 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:41:59,438 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, 1, 1] [2024-11-20 14:41:59,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-20 14:41:59,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-20 14:41:59,643 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-11-20 14:41:59,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:41:59,643 INFO L85 PathProgramCache]: Analyzing trace with hash -955925939, now seen corresponding path program 1 times [2024-11-20 14:41:59,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:41:59,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660150501] [2024-11-20 14:41:59,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:41:59,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:41:59,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:41:59,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 14:41:59,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:00,188 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:42:00,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:42:00,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660150501] [2024-11-20 14:42:00,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660150501] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:42:00,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851173870] [2024-11-20 14:42:00,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:42:00,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:42:00,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:42:00,192 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:42:00,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-20 14:42:00,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:00,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-20 14:42:00,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:42:00,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:42:00,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-20 14:42:00,763 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:42:00,764 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:42:00,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851173870] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:42:00,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:42:00,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 17 [2024-11-20 14:42:00,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665102729] [2024-11-20 14:42:00,937 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:42:00,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-20 14:42:00,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:42:00,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-20 14:42:00,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2024-11-20 14:42:00,938 INFO L87 Difference]: Start difference. First operand 317 states and 431 transitions. Second operand has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 15 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-11-20 14:42:01,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:42:01,493 INFO L93 Difference]: Finished difference Result 326 states and 431 transitions. [2024-11-20 14:42:01,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 14:42:01,494 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 15 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-11-20 14:42:01,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:42:01,497 INFO L225 Difference]: With dead ends: 326 [2024-11-20 14:42:01,497 INFO L226 Difference]: Without dead ends: 326 [2024-11-20 14:42:01,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 27 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-11-20 14:42:01,498 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 329 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:42:01,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 126 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 14:42:01,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-11-20 14:42:01,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 318. [2024-11-20 14:42:01,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 280 states have (on average 1.3714285714285714) internal successors, (384), 298 states have internal predecessors, (384), 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-11-20 14:42:01,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 427 transitions. [2024-11-20 14:42:01,507 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 427 transitions. Word has length 29 [2024-11-20 14:42:01,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:42:01,508 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 427 transitions. [2024-11-20 14:42:01,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 15 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-11-20 14:42:01,508 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 427 transitions. [2024-11-20 14:42:01,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-20 14:42:01,508 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:42:01,509 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:42:01,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-20 14:42:01,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-20 14:42:01,709 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-11-20 14:42:01,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:42:01,710 INFO L85 PathProgramCache]: Analyzing trace with hash 431067010, now seen corresponding path program 1 times [2024-11-20 14:42:01,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:42:01,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905788084] [2024-11-20 14:42:01,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:42:01,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:42:01,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:01,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 14:42:01,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:01,907 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:42:01,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:42:01,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905788084] [2024-11-20 14:42:01,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905788084] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:42:01,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540450103] [2024-11-20 14:42:01,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:42:01,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:42:01,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:42:01,911 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:42:01,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-20 14:42:01,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:01,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-20 14:42:01,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:42:02,084 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-20 14:42:02,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-20 14:42:02,141 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:42:02,141 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:42:02,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540450103] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:42:02,188 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:42:02,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2024-11-20 14:42:02,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721777315] [2024-11-20 14:42:02,188 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:42:02,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 14:42:02,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:42:02,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 14:42:02,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-20 14:42:02,190 INFO L87 Difference]: Start difference. First operand 318 states and 427 transitions. Second operand has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 8 states have internal predecessors, (41), 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-11-20 14:42:02,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:42:02,650 INFO L93 Difference]: Finished difference Result 436 states and 544 transitions. [2024-11-20 14:42:02,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 14:42:02,651 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 8 states have internal predecessors, (41), 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 30 [2024-11-20 14:42:02,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:42:02,653 INFO L225 Difference]: With dead ends: 436 [2024-11-20 14:42:02,653 INFO L226 Difference]: Without dead ends: 436 [2024-11-20 14:42:02,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 34 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-11-20 14:42:02,654 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 348 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:42:02,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 170 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 14:42:02,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2024-11-20 14:42:02,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 395. [2024-11-20 14:42:02,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 354 states have (on average 1.3389830508474576) internal successors, (474), 373 states have internal predecessors, (474), 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-11-20 14:42:02,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 516 transitions. [2024-11-20 14:42:02,664 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 516 transitions. Word has length 30 [2024-11-20 14:42:02,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:42:02,665 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 516 transitions. [2024-11-20 14:42:02,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 8 states have internal predecessors, (41), 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-11-20 14:42:02,665 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 516 transitions. [2024-11-20 14:42:02,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-20 14:42:02,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:42:02,666 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:42:02,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-20 14:42:02,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:42:02,867 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-11-20 14:42:02,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:42:02,867 INFO L85 PathProgramCache]: Analyzing trace with hash 478175471, now seen corresponding path program 1 times [2024-11-20 14:42:02,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:42:02,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093470399] [2024-11-20 14:42:02,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:42:02,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:42:02,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:03,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 14:42:03,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:03,189 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:42:03,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:42:03,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093470399] [2024-11-20 14:42:03,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093470399] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:42:03,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096492180] [2024-11-20 14:42:03,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:42:03,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:42:03,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:42:03,193 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:42:03,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-20 14:42:03,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:03,266 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-20 14:42:03,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:42:03,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:42:03,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-20 14:42:03,481 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:42:03,481 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:42:03,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096492180] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:42:03,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:42:03,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 14 [2024-11-20 14:42:03,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430445338] [2024-11-20 14:42:03,605 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:42:03,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-20 14:42:03,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:42:03,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-20 14:42:03,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2024-11-20 14:42:03,607 INFO L87 Difference]: Start difference. First operand 395 states and 516 transitions. Second operand has 16 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 10 states have internal predecessors, (56), 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-11-20 14:42:04,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:42:04,304 INFO L93 Difference]: Finished difference Result 529 states and 643 transitions. [2024-11-20 14:42:04,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-20 14:42:04,305 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 10 states have internal predecessors, (56), 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 31 [2024-11-20 14:42:04,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:42:04,307 INFO L225 Difference]: With dead ends: 529 [2024-11-20 14:42:04,307 INFO L226 Difference]: Without dead ends: 529 [2024-11-20 14:42:04,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 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-11-20 14:42:04,309 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 350 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:42:04,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 227 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 14:42:04,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2024-11-20 14:42:04,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 485. [2024-11-20 14:42:04,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 441 states have (on average 1.3174603174603174) internal successors, (581), 462 states have internal predecessors, (581), 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-11-20 14:42:04,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 619 transitions. [2024-11-20 14:42:04,321 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 619 transitions. Word has length 31 [2024-11-20 14:42:04,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:42:04,321 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 619 transitions. [2024-11-20 14:42:04,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 10 states have internal predecessors, (56), 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-11-20 14:42:04,322 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 619 transitions. [2024-11-20 14:42:04,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-20 14:42:04,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:42:04,322 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, 1] [2024-11-20 14:42:04,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-20 14:42:04,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:42:04,527 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-11-20 14:42:04,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:42:04,527 INFO L85 PathProgramCache]: Analyzing trace with hash 850193333, now seen corresponding path program 1 times [2024-11-20 14:42:04,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:42:04,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948089336] [2024-11-20 14:42:04,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:42:04,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:42:04,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:04,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 14:42:04,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:04,799 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:42:04,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:42:04,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948089336] [2024-11-20 14:42:04,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948089336] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:42:04,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894489156] [2024-11-20 14:42:04,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:42:04,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:42:04,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:42:04,802 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:42:04,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-20 14:42:04,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:04,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-20 14:42:04,875 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:42:05,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:42:05,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-20 14:42:05,293 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:42:05,294 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:42:05,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894489156] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:42:05,472 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:42:05,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 16 [2024-11-20 14:42:05,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864767592] [2024-11-20 14:42:05,473 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:42:05,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-20 14:42:05,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:42:05,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-20 14:42:05,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2024-11-20 14:42:05,475 INFO L87 Difference]: Start difference. First operand 485 states and 619 transitions. Second operand has 18 states, 17 states have (on average 3.764705882352941) internal successors, (64), 14 states have internal predecessors, (64), 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-11-20 14:42:06,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:42:06,011 INFO L93 Difference]: Finished difference Result 499 states and 612 transitions. [2024-11-20 14:42:06,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 14:42:06,011 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.764705882352941) internal successors, (64), 14 states have internal predecessors, (64), 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 35 [2024-11-20 14:42:06,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:42:06,013 INFO L225 Difference]: With dead ends: 499 [2024-11-20 14:42:06,013 INFO L226 Difference]: Without dead ends: 499 [2024-11-20 14:42:06,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 38 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-11-20 14:42:06,014 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 422 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:42:06,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 127 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 14:42:06,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2024-11-20 14:42:06,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 482. [2024-11-20 14:42:06,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 441 states have (on average 1.2698412698412698) internal successors, (560), 459 states have internal predecessors, (560), 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-11-20 14:42:06,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 598 transitions. [2024-11-20 14:42:06,025 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 598 transitions. Word has length 35 [2024-11-20 14:42:06,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:42:06,025 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 598 transitions. [2024-11-20 14:42:06,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.764705882352941) internal successors, (64), 14 states have internal predecessors, (64), 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-11-20 14:42:06,026 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 598 transitions. [2024-11-20 14:42:06,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-20 14:42:06,026 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:42:06,026 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, 1, 1] [2024-11-20 14:42:06,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-20 14:42:06,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:42:06,230 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-11-20 14:42:06,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:42:06,230 INFO L85 PathProgramCache]: Analyzing trace with hash 2003179406, now seen corresponding path program 1 times [2024-11-20 14:42:06,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:42:06,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139268182] [2024-11-20 14:42:06,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:42:06,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:42:06,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:06,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 14:42:06,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:06,402 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-20 14:42:06,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:42:06,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139268182] [2024-11-20 14:42:06,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139268182] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:42:06,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084990822] [2024-11-20 14:42:06,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:42:06,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:42:06,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:42:06,405 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:42:06,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-20 14:42:06,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:06,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-20 14:42:06,500 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:42:06,690 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-20 14:42:06,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-20 14:42:06,768 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-20 14:42:06,768 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:42:06,806 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-11-20 14:42:07,032 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-11-20 14:42:07,056 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-20 14:42:07,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084990822] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:42:07,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:42:07,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2024-11-20 14:42:07,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981906840] [2024-11-20 14:42:07,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:42:07,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-20 14:42:07,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:42:07,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-20 14:42:07,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-11-20 14:42:07,058 INFO L87 Difference]: Start difference. First operand 482 states and 598 transitions. Second operand has 17 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 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-11-20 14:42:07,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:42:07,394 INFO L93 Difference]: Finished difference Result 521 states and 624 transitions. [2024-11-20 14:42:07,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 14:42:07,394 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 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 36 [2024-11-20 14:42:07,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:42:07,396 INFO L225 Difference]: With dead ends: 521 [2024-11-20 14:42:07,396 INFO L226 Difference]: Without dead ends: 521 [2024-11-20 14:42:07,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 61 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-11-20 14:42:07,397 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 324 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:42:07,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 155 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:42:07,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2024-11-20 14:42:07,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 485. [2024-11-20 14:42:07,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 444 states have (on average 1.268018018018018) internal successors, (563), 462 states have internal predecessors, (563), 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-11-20 14:42:07,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 600 transitions. [2024-11-20 14:42:07,407 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 600 transitions. Word has length 36 [2024-11-20 14:42:07,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:42:07,408 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 600 transitions. [2024-11-20 14:42:07,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 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-11-20 14:42:07,408 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 600 transitions. [2024-11-20 14:42:07,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-20 14:42:07,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:42:07,409 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, 1, 1] [2024-11-20 14:42:07,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-20 14:42:07,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-20 14:42:07,610 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-11-20 14:42:07,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:42:07,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1969019423, now seen corresponding path program 1 times [2024-11-20 14:42:07,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:42:07,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479052499] [2024-11-20 14:42:07,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:42:07,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:42:07,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:07,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 14:42:07,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:08,148 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:42:08,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:42:08,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479052499] [2024-11-20 14:42:08,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479052499] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:42:08,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090548521] [2024-11-20 14:42:08,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:42:08,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:42:08,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:42:08,151 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:42:08,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-20 14:42:08,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:08,222 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-20 14:42:08,223 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:42:08,574 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:42:08,574 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:42:08,846 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:42:08,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090548521] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:42:08,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:42:08,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 24 [2024-11-20 14:42:08,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146958963] [2024-11-20 14:42:08,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:42:08,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-20 14:42:08,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:42:08,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-20 14:42:08,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2024-11-20 14:42:08,848 INFO L87 Difference]: Start difference. First operand 485 states and 600 transitions. Second operand has 25 states, 25 states have (on average 3.92) internal successors, (98), 20 states have internal predecessors, (98), 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-11-20 14:42:10,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:42:10,245 INFO L93 Difference]: Finished difference Result 693 states and 827 transitions. [2024-11-20 14:42:10,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-20 14:42:10,245 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.92) internal successors, (98), 20 states have internal predecessors, (98), 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 37 [2024-11-20 14:42:10,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:42:10,248 INFO L225 Difference]: With dead ends: 693 [2024-11-20 14:42:10,248 INFO L226 Difference]: Without dead ends: 693 [2024-11-20 14:42:10,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 61 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-11-20 14:42:10,249 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 899 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 899 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 14:42:10,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [899 Valid, 330 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 14:42:10,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2024-11-20 14:42:10,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 488. [2024-11-20 14:42:10,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 449 states have (on average 1.2583518930957684) internal successors, (565), 467 states have internal predecessors, (565), 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-11-20 14:42:10,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 599 transitions. [2024-11-20 14:42:10,261 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 599 transitions. Word has length 37 [2024-11-20 14:42:10,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:42:10,262 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 599 transitions. [2024-11-20 14:42:10,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.92) internal successors, (98), 20 states have internal predecessors, (98), 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-11-20 14:42:10,262 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 599 transitions. [2024-11-20 14:42:10,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-20 14:42:10,263 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:42:10,263 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:42:10,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-20 14:42:10,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-20 14:42:10,464 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-11-20 14:42:10,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:42:10,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1392814043, now seen corresponding path program 1 times [2024-11-20 14:42:10,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:42:10,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144367811] [2024-11-20 14:42:10,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:42:10,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:42:10,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:10,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 14:42:10,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:10,538 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 25 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:42:10,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:42:10,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144367811] [2024-11-20 14:42:10,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144367811] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:42:10,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729957296] [2024-11-20 14:42:10,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:42:10,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:42:10,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:42:10,541 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:42:10,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-20 14:42:10,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:10,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 14:42:10,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:42:10,649 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:42:10,649 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:42:10,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729957296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:42:10,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 14:42:10,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-11-20 14:42:10,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724482678] [2024-11-20 14:42:10,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:42:10,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:42:10,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:42:10,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:42:10,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-20 14:42:10,651 INFO L87 Difference]: Start difference. First operand 488 states and 599 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-11-20 14:42:10,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:42:10,675 INFO L93 Difference]: Finished difference Result 292 states and 341 transitions. [2024-11-20 14:42:10,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:42:10,676 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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 45 [2024-11-20 14:42:10,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:42:10,677 INFO L225 Difference]: With dead ends: 292 [2024-11-20 14:42:10,678 INFO L226 Difference]: Without dead ends: 292 [2024-11-20 14:42:10,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 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-11-20 14:42:10,680 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 15 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 132 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-11-20 14:42:10,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 132 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:42:10,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-11-20 14:42:10,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 288. [2024-11-20 14:42:10,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 260 states have (on average 1.226923076923077) internal successors, (319), 273 states have internal predecessors, (319), 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-11-20 14:42:10,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 339 transitions. [2024-11-20 14:42:10,687 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 339 transitions. Word has length 45 [2024-11-20 14:42:10,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:42:10,687 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 339 transitions. [2024-11-20 14:42:10,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-11-20 14:42:10,687 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 339 transitions. [2024-11-20 14:42:10,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-20 14:42:10,688 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:42:10,688 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-20 14:42:10,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-20 14:42:10,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-20 14:42:10,892 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-11-20 14:42:10,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:42:10,893 INFO L85 PathProgramCache]: Analyzing trace with hash -736414851, now seen corresponding path program 1 times [2024-11-20 14:42:10,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:42:10,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726388829] [2024-11-20 14:42:10,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:42:10,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:42:10,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:10,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 14:42:10,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:10,987 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-20 14:42:10,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:42:10,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726388829] [2024-11-20 14:42:10,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726388829] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:42:10,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475261429] [2024-11-20 14:42:10,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:42:10,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:42:10,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:42:10,991 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:42:10,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-20 14:42:11,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:11,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-20 14:42:11,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:42:11,116 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-20 14:42:11,116 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:42:11,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475261429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:42:11,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 14:42:11,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2024-11-20 14:42:11,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830644483] [2024-11-20 14:42:11,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:42:11,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:42:11,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:42:11,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:42:11,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:42:11,117 INFO L87 Difference]: Start difference. First operand 288 states and 339 transitions. Second operand has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 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-11-20 14:42:11,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:42:11,131 INFO L93 Difference]: Finished difference Result 287 states and 336 transitions. [2024-11-20 14:42:11,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:42:11,134 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 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 47 [2024-11-20 14:42:11,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:42:11,135 INFO L225 Difference]: With dead ends: 287 [2024-11-20 14:42:11,135 INFO L226 Difference]: Without dead ends: 287 [2024-11-20 14:42:11,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:42:11,136 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 26 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:42:11,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 82 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:42:11,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-11-20 14:42:11,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2024-11-20 14:42:11,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 260 states have (on average 1.2153846153846153) internal successors, (316), 272 states have internal predecessors, (316), 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-11-20 14:42:11,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 336 transitions. [2024-11-20 14:42:11,142 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 336 transitions. Word has length 47 [2024-11-20 14:42:11,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:42:11,142 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 336 transitions. [2024-11-20 14:42:11,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 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-11-20 14:42:11,142 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 336 transitions. [2024-11-20 14:42:11,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-20 14:42:11,143 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:42:11,143 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-20 14:42:11,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-20 14:42:11,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-20 14:42:11,344 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-11-20 14:42:11,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:42:11,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1354023829, now seen corresponding path program 1 times [2024-11-20 14:42:11,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:42:11,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000434650] [2024-11-20 14:42:11,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:42:11,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:42:11,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:11,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 14:42:11,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:11,437 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-20 14:42:11,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:42:11,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000434650] [2024-11-20 14:42:11,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000434650] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:42:11,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506905642] [2024-11-20 14:42:11,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:42:11,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:42:11,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:42:11,440 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:42:11,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-20 14:42:11,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:11,520 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 14:42:11,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:42:11,568 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-20 14:42:11,568 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:42:11,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506905642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:42:11,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 14:42:11,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2024-11-20 14:42:11,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770756831] [2024-11-20 14:42:11,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:42:11,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:42:11,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:42:11,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:42:11,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:42:11,570 INFO L87 Difference]: Start difference. First operand 287 states and 336 transitions. Second operand has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 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-11-20 14:42:11,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:42:11,601 INFO L93 Difference]: Finished difference Result 286 states and 332 transitions. [2024-11-20 14:42:11,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:42:11,602 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 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 48 [2024-11-20 14:42:11,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:42:11,603 INFO L225 Difference]: With dead ends: 286 [2024-11-20 14:42:11,603 INFO L226 Difference]: Without dead ends: 286 [2024-11-20 14:42:11,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 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-11-20 14:42:11,604 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 24 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:42:11,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 68 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:42:11,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-11-20 14:42:11,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2024-11-20 14:42:11,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 260 states have (on average 1.2) internal successors, (312), 271 states have internal predecessors, (312), 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-11-20 14:42:11,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 332 transitions. [2024-11-20 14:42:11,613 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 332 transitions. Word has length 48 [2024-11-20 14:42:11,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:42:11,613 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 332 transitions. [2024-11-20 14:42:11,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 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-11-20 14:42:11,614 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 332 transitions. [2024-11-20 14:42:11,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-20 14:42:11,614 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:42:11,614 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-20 14:42:11,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-20 14:42:11,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:42:11,815 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-11-20 14:42:11,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:42:11,815 INFO L85 PathProgramCache]: Analyzing trace with hash 974934335, now seen corresponding path program 1 times [2024-11-20 14:42:11,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:42:11,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017592254] [2024-11-20 14:42:11,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:42:11,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:42:11,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:11,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 14:42:11,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:11,917 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-20 14:42:11,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:42:11,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017592254] [2024-11-20 14:42:11,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017592254] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:42:11,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341594410] [2024-11-20 14:42:11,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:42:11,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:42:11,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:42:11,921 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:42:11,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-20 14:42:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:12,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-20 14:42:12,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:42:12,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 14:42:12,049 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-20 14:42:12,049 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:42:12,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341594410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:42:12,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 14:42:12,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2024-11-20 14:42:12,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140652934] [2024-11-20 14:42:12,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:42:12,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:42:12,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:42:12,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:42:12,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:42:12,051 INFO L87 Difference]: Start difference. First operand 286 states and 332 transitions. Second operand has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 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-11-20 14:42:12,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:42:12,107 INFO L93 Difference]: Finished difference Result 300 states and 340 transitions. [2024-11-20 14:42:12,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:42:12,107 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 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 49 [2024-11-20 14:42:12,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:42:12,108 INFO L225 Difference]: With dead ends: 300 [2024-11-20 14:42:12,108 INFO L226 Difference]: Without dead ends: 300 [2024-11-20 14:42:12,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:42:12,109 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 18 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 111 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.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:42:12,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 111 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:42:12,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-11-20 14:42:12,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 286. [2024-11-20 14:42:12,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 260 states have (on average 1.1884615384615385) internal successors, (309), 271 states have internal predecessors, (309), 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-11-20 14:42:12,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 329 transitions. [2024-11-20 14:42:12,116 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 329 transitions. Word has length 49 [2024-11-20 14:42:12,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:42:12,116 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 329 transitions. [2024-11-20 14:42:12,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 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-11-20 14:42:12,116 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 329 transitions. [2024-11-20 14:42:12,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-20 14:42:12,117 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:42:12,117 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:42:12,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-20 14:42:12,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-20 14:42:12,318 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-11-20 14:42:12,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:42:12,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1716482195, now seen corresponding path program 1 times [2024-11-20 14:42:12,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:42:12,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068823472] [2024-11-20 14:42:12,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:42:12,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:42:12,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:12,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 14:42:12,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:12,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 14:42:12,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:12,573 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-20 14:42:12,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:42:12,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068823472] [2024-11-20 14:42:12,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068823472] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:42:12,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377194146] [2024-11-20 14:42:12,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:42:12,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:42:12,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:42:12,576 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:42:12,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-20 14:42:12,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:12,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-20 14:42:12,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:42:12,738 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-20 14:42:12,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-20 14:42:12,796 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-20 14:42:12,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-20 14:42:12,837 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-20 14:42:12,838 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:42:12,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377194146] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:42:12,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:42:12,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2024-11-20 14:42:12,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116443358] [2024-11-20 14:42:12,890 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:42:12,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 14:42:12,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:42:12,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 14:42:12,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-20 14:42:12,892 INFO L87 Difference]: Start difference. First operand 286 states and 329 transitions. Second operand has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 8 states have internal predecessors, (43), 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-11-20 14:42:13,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:42:13,260 INFO L93 Difference]: Finished difference Result 302 states and 339 transitions. [2024-11-20 14:42:13,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 14:42:13,260 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 8 states have internal predecessors, (43), 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 51 [2024-11-20 14:42:13,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:42:13,261 INFO L225 Difference]: With dead ends: 302 [2024-11-20 14:42:13,261 INFO L226 Difference]: Without dead ends: 302 [2024-11-20 14:42:13,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 60 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-11-20 14:42:13,262 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 219 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:42:13,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 171 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:42:13,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-11-20 14:42:13,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 286. [2024-11-20 14:42:13,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 260 states have (on average 1.176923076923077) internal successors, (306), 271 states have internal predecessors, (306), 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-11-20 14:42:13,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 326 transitions. [2024-11-20 14:42:13,267 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 326 transitions. Word has length 51 [2024-11-20 14:42:13,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:42:13,267 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 326 transitions. [2024-11-20 14:42:13,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 8 states have internal predecessors, (43), 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-11-20 14:42:13,267 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 326 transitions. [2024-11-20 14:42:13,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-20 14:42:13,268 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:42:13,268 INFO L215 NwaCegarLoop]: trace histogram [3, 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, 1] [2024-11-20 14:42:13,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-20 14:42:13,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-20 14:42:13,472 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-11-20 14:42:13,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:42:13,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1671340444, now seen corresponding path program 1 times [2024-11-20 14:42:13,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:42:13,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357159786] [2024-11-20 14:42:13,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:42:13,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:42:13,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:13,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 14:42:13,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:13,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 14:42:13,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:13,846 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:42:13,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:42:13,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357159786] [2024-11-20 14:42:13,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357159786] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:42:13,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611843782] [2024-11-20 14:42:13,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:42:13,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:42:13,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:42:13,850 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:42:13,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-20 14:42:13,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:13,933 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-20 14:42:13,935 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:42:14,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:42:14,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-20 14:42:14,109 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-20 14:42:14,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-20 14:42:14,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:42:14,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-20 14:42:14,294 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-20 14:42:14,294 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:42:14,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611843782] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:42:14,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:42:14,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 19 [2024-11-20 14:42:14,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414489452] [2024-11-20 14:42:14,411 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:42:14,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-20 14:42:14,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:42:14,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-20 14:42:14,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2024-11-20 14:42:14,413 INFO L87 Difference]: Start difference. First operand 286 states and 326 transitions. Second operand has 21 states, 17 states have (on average 4.823529411764706) internal successors, (82), 14 states have internal predecessors, (82), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-20 14:42:14,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:42:14,938 INFO L93 Difference]: Finished difference Result 300 states and 331 transitions. [2024-11-20 14:42:14,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 14:42:14,942 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 4.823529411764706) internal successors, (82), 14 states have internal predecessors, (82), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 52 [2024-11-20 14:42:14,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:42:14,943 INFO L225 Difference]: With dead ends: 300 [2024-11-20 14:42:14,944 INFO L226 Difference]: Without dead ends: 300 [2024-11-20 14:42:14,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=297, Invalid=963, Unknown=0, NotChecked=0, Total=1260 [2024-11-20 14:42:14,945 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 388 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:42:14,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 198 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 14:42:14,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-11-20 14:42:14,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 285. [2024-11-20 14:42:14,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 260 states have (on average 1.146153846153846) internal successors, (298), 270 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-11-20 14:42:14,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 318 transitions. [2024-11-20 14:42:14,950 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 318 transitions. Word has length 52 [2024-11-20 14:42:14,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:42:14,951 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 318 transitions. [2024-11-20 14:42:14,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 4.823529411764706) internal successors, (82), 14 states have internal predecessors, (82), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-20 14:42:14,951 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 318 transitions. [2024-11-20 14:42:14,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-20 14:42:14,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:42:14,952 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2024-11-20 14:42:14,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-11-20 14:42:15,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-20 14:42:15,156 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-11-20 14:42:15,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:42:15,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1609725499, now seen corresponding path program 1 times [2024-11-20 14:42:15,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:42:15,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163137704] [2024-11-20 14:42:15,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:42:15,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:42:15,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:15,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 14:42:15,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:15,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 14:42:15,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:15,355 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-20 14:42:15,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:42:15,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163137704] [2024-11-20 14:42:15,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163137704] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:42:15,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422303054] [2024-11-20 14:42:15,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:42:15,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:42:15,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:42:15,358 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:42:15,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-20 14:42:15,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:15,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-20 14:42:15,443 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:42:15,549 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-20 14:42:15,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-20 14:42:15,734 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-20 14:42:15,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-20 14:42:15,792 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 31 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-20 14:42:15,793 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:42:15,819 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-11-20 14:42:15,945 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-11-20 14:42:16,095 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-20 14:42:16,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422303054] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:42:16,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:42:16,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 22 [2024-11-20 14:42:16,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370814826] [2024-11-20 14:42:16,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:42:16,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-20 14:42:16,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:42:16,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-20 14:42:16,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2024-11-20 14:42:16,098 INFO L87 Difference]: Start difference. First operand 285 states and 318 transitions. Second operand has 23 states, 21 states have (on average 6.571428571428571) internal successors, (138), 21 states have internal predecessors, (138), 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-11-20 14:42:16,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:42:16,294 INFO L93 Difference]: Finished difference Result 295 states and 328 transitions. [2024-11-20 14:42:16,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 14:42:16,294 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 6.571428571428571) internal successors, (138), 21 states have internal predecessors, (138), 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 57 [2024-11-20 14:42:16,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:42:16,296 INFO L225 Difference]: With dead ends: 295 [2024-11-20 14:42:16,296 INFO L226 Difference]: Without dead ends: 295 [2024-11-20 14:42:16,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 106 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-11-20 14:42:16,297 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 200 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:42:16,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 70 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:42:16,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-11-20 14:42:16,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 284. [2024-11-20 14:42:16,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 260 states have (on average 1.1423076923076922) internal successors, (297), 269 states have internal predecessors, (297), 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-11-20 14:42:16,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 317 transitions. [2024-11-20 14:42:16,302 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 317 transitions. Word has length 57 [2024-11-20 14:42:16,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:42:16,303 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 317 transitions. [2024-11-20 14:42:16,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 6.571428571428571) internal successors, (138), 21 states have internal predecessors, (138), 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-11-20 14:42:16,303 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 317 transitions. [2024-11-20 14:42:16,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-20 14:42:16,303 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:42:16,304 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2024-11-20 14:42:16,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-20 14:42:16,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-20 14:42:16,508 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-11-20 14:42:16,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:42:16,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1638117102, now seen corresponding path program 1 times [2024-11-20 14:42:16,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:42:16,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007815518] [2024-11-20 14:42:16,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:42:16,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:42:16,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:16,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 14:42:16,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:17,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 14:42:17,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:17,125 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-20 14:42:17,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:42:17,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007815518] [2024-11-20 14:42:17,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007815518] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:42:17,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605473538] [2024-11-20 14:42:17,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:42:17,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:42:17,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:42:17,129 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:42:17,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-20 14:42:17,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:17,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-20 14:42:17,236 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:42:17,437 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-20 14:42:17,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-20 14:42:17,744 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-20 14:42:17,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-20 14:42:17,851 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-20 14:42:17,851 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:42:17,918 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-11-20 14:42:18,119 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:42:18,119 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-11-20 14:42:18,358 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 36 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-20 14:42:18,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605473538] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:42:18,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:42:18,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 13] total 39 [2024-11-20 14:42:18,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001263399] [2024-11-20 14:42:18,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:42:18,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-20 14:42:18,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:42:18,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-20 14:42:18,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1467, Unknown=0, NotChecked=0, Total=1640 [2024-11-20 14:42:18,361 INFO L87 Difference]: Start difference. First operand 284 states and 317 transitions. Second operand has 41 states, 37 states have (on average 3.945945945945946) internal successors, (146), 32 states have internal predecessors, (146), 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-11-20 14:42:18,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:42:18,937 INFO L93 Difference]: Finished difference Result 295 states and 327 transitions. [2024-11-20 14:42:18,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 14:42:18,938 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 37 states have (on average 3.945945945945946) internal successors, (146), 32 states have internal predecessors, (146), 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 58 [2024-11-20 14:42:18,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:42:18,939 INFO L225 Difference]: With dead ends: 295 [2024-11-20 14:42:18,939 INFO L226 Difference]: Without dead ends: 295 [2024-11-20 14:42:18,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 92 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-11-20 14:42:18,941 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 253 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 14:42:18,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 267 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 14:42:18,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-11-20 14:42:18,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 284. [2024-11-20 14:42:18,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 260 states have (on average 1.1384615384615384) internal successors, (296), 269 states have internal predecessors, (296), 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-11-20 14:42:18,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 316 transitions. [2024-11-20 14:42:18,946 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 316 transitions. Word has length 58 [2024-11-20 14:42:18,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:42:18,947 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 316 transitions. [2024-11-20 14:42:18,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 37 states have (on average 3.945945945945946) internal successors, (146), 32 states have internal predecessors, (146), 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-11-20 14:42:18,947 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 316 transitions. [2024-11-20 14:42:18,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-20 14:42:18,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:42:18,948 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:42:18,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-20 14:42:19,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:42:19,153 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-11-20 14:42:19,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:42:19,153 INFO L85 PathProgramCache]: Analyzing trace with hash 147398217, now seen corresponding path program 1 times [2024-11-20 14:42:19,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:42:19,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240201708] [2024-11-20 14:42:19,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:42:19,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:42:19,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:19,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 14:42:19,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:19,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 14:42:19,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:19,724 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:42:19,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:42:19,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240201708] [2024-11-20 14:42:19,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240201708] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:42:19,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82633772] [2024-11-20 14:42:19,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:42:19,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:42:19,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:42:19,727 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:42:19,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-20 14:42:19,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:19,824 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-20 14:42:19,826 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:42:20,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:42:20,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-20 14:42:20,379 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-20 14:42:20,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-20 14:42:20,599 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:42:20,599 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:42:20,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82633772] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:42:20,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:42:20,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 24 [2024-11-20 14:42:20,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298106559] [2024-11-20 14:42:20,822 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:42:20,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-20 14:42:20,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:42:20,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-20 14:42:20,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=812, Unknown=0, NotChecked=0, Total=930 [2024-11-20 14:42:20,823 INFO L87 Difference]: Start difference. First operand 284 states and 316 transitions. Second operand has 26 states, 23 states have (on average 4.608695652173913) internal successors, (106), 20 states have internal predecessors, (106), 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-11-20 14:42:21,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:42:21,818 INFO L93 Difference]: Finished difference Result 307 states and 338 transitions. [2024-11-20 14:42:21,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-20 14:42:21,819 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 4.608695652173913) internal successors, (106), 20 states have internal predecessors, (106), 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 58 [2024-11-20 14:42:21,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:42:21,820 INFO L225 Difference]: With dead ends: 307 [2024-11-20 14:42:21,820 INFO L226 Difference]: Without dead ends: 307 [2024-11-20 14:42:21,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=462, Invalid=1794, Unknown=0, NotChecked=0, Total=2256 [2024-11-20 14:42:21,822 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 449 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 14:42:21,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 211 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 14:42:21,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-11-20 14:42:21,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 243. [2024-11-20 14:42:21,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 224 states have (on average 1.1339285714285714) internal successors, (254), 230 states have internal predecessors, (254), 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-11-20 14:42:21,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 269 transitions. [2024-11-20 14:42:21,826 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 269 transitions. Word has length 58 [2024-11-20 14:42:21,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:42:21,827 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 269 transitions. [2024-11-20 14:42:21,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 4.608695652173913) internal successors, (106), 20 states have internal predecessors, (106), 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-11-20 14:42:21,827 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 269 transitions. [2024-11-20 14:42:21,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-20 14:42:21,827 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:42:21,827 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1] [2024-11-20 14:42:21,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-11-20 14:42:22,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2024-11-20 14:42:22,028 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-11-20 14:42:22,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:42:22,028 INFO L85 PathProgramCache]: Analyzing trace with hash 2022464052, now seen corresponding path program 1 times [2024-11-20 14:42:22,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:42:22,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429747613] [2024-11-20 14:42:22,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:42:22,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:42:22,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:22,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 14:42:22,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:22,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 14:42:22,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:22,323 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-20 14:42:22,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:42:22,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429747613] [2024-11-20 14:42:22,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429747613] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:42:22,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948813966] [2024-11-20 14:42:22,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:42:22,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:42:22,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:42:22,326 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:42:22,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-20 14:42:22,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:22,411 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-20 14:42:22,413 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:42:22,484 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-20 14:42:22,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-20 14:42:22,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-20 14:42:22,647 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 20 proven. 20 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-20 14:42:22,647 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:42:22,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948813966] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:42:22,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:42:22,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2024-11-20 14:42:22,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463296785] [2024-11-20 14:42:22,941 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:42:22,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-20 14:42:22,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:42:22,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-20 14:42:22,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2024-11-20 14:42:22,943 INFO L87 Difference]: Start difference. First operand 243 states and 269 transitions. Second operand has 18 states, 16 states have (on average 5.3125) internal successors, (85), 13 states have internal predecessors, (85), 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-11-20 14:42:23,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:42:23,275 INFO L93 Difference]: Finished difference Result 256 states and 282 transitions. [2024-11-20 14:42:23,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 14:42:23,276 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 5.3125) internal successors, (85), 13 states have internal predecessors, (85), 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 60 [2024-11-20 14:42:23,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:42:23,277 INFO L225 Difference]: With dead ends: 256 [2024-11-20 14:42:23,277 INFO L226 Difference]: Without dead ends: 256 [2024-11-20 14:42:23,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=243, Invalid=687, Unknown=0, NotChecked=0, Total=930 [2024-11-20 14:42:23,278 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 195 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:42:23,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 175 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:42:23,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-11-20 14:42:23,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 242. [2024-11-20 14:42:23,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 224 states have (on average 1.1294642857142858) internal successors, (253), 229 states have internal predecessors, (253), 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-11-20 14:42:23,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 268 transitions. [2024-11-20 14:42:23,290 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 268 transitions. Word has length 60 [2024-11-20 14:42:23,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:42:23,290 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 268 transitions. [2024-11-20 14:42:23,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 5.3125) internal successors, (85), 13 states have internal predecessors, (85), 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-11-20 14:42:23,291 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 268 transitions. [2024-11-20 14:42:23,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-20 14:42:23,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:42:23,291 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 2, 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, 1] [2024-11-20 14:42:23,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-11-20 14:42:23,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:42:23,492 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-11-20 14:42:23,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:42:23,492 INFO L85 PathProgramCache]: Analyzing trace with hash -383711253, now seen corresponding path program 2 times [2024-11-20 14:42:23,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:42:23,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488674276] [2024-11-20 14:42:23,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:42:23,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:42:23,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:23,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-20 14:42:23,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:23,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 14:42:23,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:23,882 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 19 proven. 39 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-20 14:42:23,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:42:23,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488674276] [2024-11-20 14:42:23,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488674276] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:42:23,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98416968] [2024-11-20 14:42:23,883 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 14:42:23,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:42:23,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:42:23,886 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:42:23,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-20 14:42:23,982 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 14:42:23,982 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 14:42:23,983 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-20 14:42:23,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:42:24,128 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-20 14:42:24,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-20 14:42:24,388 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-20 14:42:24,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-20 14:42:24,590 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:42:24,590 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:42:24,786 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-11-20 14:42:24,969 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:42:24,970 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-11-20 14:42:25,295 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 1 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:42:25,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98416968] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:42:25,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:42:25,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 16] total 42 [2024-11-20 14:42:25,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597809728] [2024-11-20 14:42:25,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:42:25,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-20 14:42:25,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:42:25,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-20 14:42:25,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1689, Unknown=0, NotChecked=0, Total=1892 [2024-11-20 14:42:25,298 INFO L87 Difference]: Start difference. First operand 242 states and 268 transitions. Second operand has 44 states, 40 states have (on average 4.4) internal successors, (176), 36 states have internal predecessors, (176), 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-11-20 14:42:25,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:42:25,904 INFO L93 Difference]: Finished difference Result 255 states and 281 transitions. [2024-11-20 14:42:25,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 14:42:25,904 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 40 states have (on average 4.4) internal successors, (176), 36 states have internal predecessors, (176), 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 66 [2024-11-20 14:42:25,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:42:25,905 INFO L225 Difference]: With dead ends: 255 [2024-11-20 14:42:25,905 INFO L226 Difference]: Without dead ends: 255 [2024-11-20 14:42:25,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=463, Invalid=2399, Unknown=0, NotChecked=0, Total=2862 [2024-11-20 14:42:25,906 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 415 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:42:25,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 208 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 14:42:25,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-20 14:42:25,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 241. [2024-11-20 14:42:25,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 224 states have (on average 1.125) internal successors, (252), 228 states have internal predecessors, (252), 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-11-20 14:42:25,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 267 transitions. [2024-11-20 14:42:25,911 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 267 transitions. Word has length 66 [2024-11-20 14:42:25,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:42:25,911 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 267 transitions. [2024-11-20 14:42:25,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 40 states have (on average 4.4) internal successors, (176), 36 states have internal predecessors, (176), 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-11-20 14:42:25,911 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 267 transitions. [2024-11-20 14:42:25,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-20 14:42:25,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:42:25,912 INFO L215 NwaCegarLoop]: trace histogram [3, 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, 1] [2024-11-20 14:42:25,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2024-11-20 14:42:26,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:42:26,113 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-11-20 14:42:26,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:42:26,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1230760792, now seen corresponding path program 1 times [2024-11-20 14:42:26,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:42:26,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195350886] [2024-11-20 14:42:26,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:42:26,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:42:26,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 14:42:26,138 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 14:42:26,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 14:42:26,197 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 14:42:26,198 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 14:42:26,199 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (19 of 20 remaining) [2024-11-20 14:42:26,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 20 remaining) [2024-11-20 14:42:26,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 20 remaining) [2024-11-20 14:42:26,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (16 of 20 remaining) [2024-11-20 14:42:26,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (15 of 20 remaining) [2024-11-20 14:42:26,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE (14 of 20 remaining) [2024-11-20 14:42:26,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE (13 of 20 remaining) [2024-11-20 14:42:26,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 20 remaining) [2024-11-20 14:42:26,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 20 remaining) [2024-11-20 14:42:26,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 20 remaining) [2024-11-20 14:42:26,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 20 remaining) [2024-11-20 14:42:26,204 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr10ASSERT_VIOLATIONMEMORY_FREE (8 of 20 remaining) [2024-11-20 14:42:26,204 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr11ASSERT_VIOLATIONMEMORY_FREE (7 of 20 remaining) [2024-11-20 14:42:26,204 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr12ASSERT_VIOLATIONMEMORY_FREE (6 of 20 remaining) [2024-11-20 14:42:26,204 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr13ASSERT_VIOLATIONMEMORY_FREE (5 of 20 remaining) [2024-11-20 14:42:26,204 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr14ASSERT_VIOLATIONMEMORY_FREE (4 of 20 remaining) [2024-11-20 14:42:26,204 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr15ASSERT_VIOLATIONMEMORY_FREE (3 of 20 remaining) [2024-11-20 14:42:26,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr16ASSERT_VIOLATIONMEMORY_FREE (2 of 20 remaining) [2024-11-20 14:42:26,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr17ASSERT_VIOLATIONMEMORY_FREE (1 of 20 remaining) [2024-11-20 14:42:26,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location parse_inputErr18ASSERT_VIOLATIONMEMORY_FREE (0 of 20 remaining) [2024-11-20 14:42:26,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-20 14:42:26,208 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-11-20 14:42:26,265 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 14:42:26,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 02:42:26 BoogieIcfgContainer [2024-11-20 14:42:26,268 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 14:42:26,269 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 14:42:26,269 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 14:42:26,269 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 14:42:26,269 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:41:50" (3/4) ... [2024-11-20 14:42:26,275 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 14:42:26,276 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 14:42:26,277 INFO L158 Benchmark]: Toolchain (without parser) took 36828.33ms. Allocated memory was 159.4MB in the beginning and 432.0MB in the end (delta: 272.6MB). Free memory was 109.3MB in the beginning and 355.0MB in the end (delta: -245.7MB). Peak memory consumption was 28.4MB. Max. memory is 16.1GB. [2024-11-20 14:42:26,277 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 159.4MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 14:42:26,278 INFO L158 Benchmark]: CACSL2BoogieTranslator took 555.59ms. Allocated memory is still 159.4MB. Free memory was 109.3MB in the beginning and 87.0MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-20 14:42:26,278 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.22ms. Allocated memory is still 159.4MB. Free memory was 87.0MB in the beginning and 84.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 14:42:26,279 INFO L158 Benchmark]: Boogie Preprocessor took 70.93ms. Allocated memory is still 159.4MB. Free memory was 84.9MB in the beginning and 82.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 14:42:26,280 INFO L158 Benchmark]: RCFGBuilder took 525.35ms. Allocated memory is still 159.4MB. Free memory was 82.1MB in the beginning and 64.6MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-20 14:42:26,281 INFO L158 Benchmark]: TraceAbstraction took 35612.24ms. Allocated memory was 159.4MB in the beginning and 432.0MB in the end (delta: 272.6MB). Free memory was 63.9MB in the beginning and 356.0MB in the end (delta: -292.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 14:42:26,281 INFO L158 Benchmark]: Witness Printer took 7.87ms. Allocated memory is still 432.0MB. Free memory is still 355.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 14:42:26,282 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.11ms. Allocated memory is still 159.4MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 555.59ms. Allocated memory is still 159.4MB. Free memory was 109.3MB in the beginning and 87.0MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.22ms. Allocated memory is still 159.4MB. Free memory was 87.0MB in the beginning and 84.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.93ms. Allocated memory is still 159.4MB. Free memory was 84.9MB in the beginning and 82.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 525.35ms. Allocated memory is still 159.4MB. Free memory was 82.1MB in the beginning and 64.6MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 35612.24ms. Allocated memory was 159.4MB in the beginning and 432.0MB in the end (delta: 272.6MB). Free memory was 63.9MB in the beginning and 356.0MB in the end (delta: -292.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 7.87ms. Allocated memory is still 432.0MB. Free memory is still 355.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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} }; VAL [commands={6:0}, global={0:0}, state=0] [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 VAL [\old(input)={3:0}, \old(state)=0, commands={6:0}, global={0:0}, input={3:0}, state=0] [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 VAL [\old(input)={4:0}, \old(state)=1, commands={6:0}, global={-3:0}, input={4:0}, state=1] [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 VAL [\old(input)={5:0}, \old(state)=1, commands={6:0}, global={7:0}, input={5:0}, state=1] [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, 62 locations, 20 error locations. Started 1 CEGAR loops. OverallTime: 35.5s, OverallIterations: 34, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 10.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6804 SdHoareTripleChecker+Valid, 5.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6804 mSDsluCounter, 5961 SdHoareTripleChecker+Invalid, 4.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4602 mSDsCounter, 807 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7903 IncrementalHoareTripleChecker+Invalid, 8710 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 807 mSolverCounterUnsat, 1359 mSDtfsCounter, 7903 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1711 GetRequests, 1130 SyntacticMatches, 2 SemanticMatches, 579 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3805 ImplicationChecksByTransitivity, 9.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=488occurred in iteration=22, InterpolantAutomatonStates: 312, 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, 919 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 17.3s InterpolantComputationTime, 1998 NumberOfCodeBlocks, 1998 NumberOfCodeBlocksAsserted, 57 NumberOfCheckSat, 2167 ConstructedInterpolants, 163 QuantifiedInterpolants, 26502 SizeOfPredicates, 83 NumberOfNonLiveVariables, 5543 ConjunctsInSsa, 394 ConjunctsInUnsatCore, 63 InterpolantComputations, 16 PerfectInterpolantSequences, 431/1172 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-11-20 14:42:26,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6826aeecba49275836b6b398765a757158a4e84d2c6569399d77f2320562875e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 14:42:28,536 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 14:42:28,602 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-20 14:42:28,611 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 14:42:28,612 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 14:42:28,637 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 14:42:28,638 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 14:42:28,638 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 14:42:28,639 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 14:42:28,639 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 14:42:28,640 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 14:42:28,640 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 14:42:28,641 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 14:42:28,641 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 14:42:28,641 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 14:42:28,642 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 14:42:28,642 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 14:42:28,642 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 14:42:28,643 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 14:42:28,643 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 14:42:28,643 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 14:42:28,644 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 14:42:28,644 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-20 14:42:28,644 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 14:42:28,645 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 14:42:28,645 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 14:42:28,645 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 14:42:28,645 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 14:42:28,646 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 14:42:28,646 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 14:42:28,646 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 14:42:28,646 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 14:42:28,647 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 14:42:28,647 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 14:42:28,652 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 14:42:28,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 14:42:28,653 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 14:42:28,653 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 14:42:28,653 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 14:42:28,654 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 14:42:28,656 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 14:42:28,657 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 14:42:28,657 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 14:42:28,657 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 14:42:28,657 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6826aeecba49275836b6b398765a757158a4e84d2c6569399d77f2320562875e [2024-11-20 14:42:29,007 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 14:42:29,032 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 14:42:29,035 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 14:42:29,036 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 14:42:29,037 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 14:42:29,038 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_3.i [2024-11-20 14:42:30,588 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 14:42:30,878 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 14:42:30,878 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-bftpd/bftpd_3.i [2024-11-20 14:42:30,893 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/212c1748b/e63876b123674aef825615b1bcf5b75f/FLAG1845c2bd5 [2024-11-20 14:42:31,172 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/212c1748b/e63876b123674aef825615b1bcf5b75f [2024-11-20 14:42:31,175 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 14:42:31,176 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 14:42:31,178 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 14:42:31,178 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 14:42:31,183 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 14:42:31,184 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:42:31" (1/1) ... [2024-11-20 14:42:31,187 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@489de03e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:42:31, skipping insertion in model container [2024-11-20 14:42:31,187 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:42:31" (1/1) ... [2024-11-20 14:42:31,243 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 14:42:31,636 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:42:31,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 14:42:31,663 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 14:42:31,720 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 14:42:31,763 INFO L204 MainTranslator]: Completed translation [2024-11-20 14:42:31,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:42:31 WrapperNode [2024-11-20 14:42:31,763 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 14:42:31,765 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 14:42:31,765 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 14:42:31,765 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 14:42:31,772 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:42:31" (1/1) ... [2024-11-20 14:42:31,797 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:42:31" (1/1) ... [2024-11-20 14:42:31,828 INFO L138 Inliner]: procedures = 169, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 96 [2024-11-20 14:42:31,832 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 14:42:31,833 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 14:42:31,833 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 14:42:31,833 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 14:42:31,845 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:42:31" (1/1) ... [2024-11-20 14:42:31,845 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:42:31" (1/1) ... [2024-11-20 14:42:31,849 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:42:31" (1/1) ... [2024-11-20 14:42:31,891 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [9, 9, 6]. 38 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [6, 9, 6]. The 0 writes are split as follows [0, 0, 0]. [2024-11-20 14:42:31,895 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:42:31" (1/1) ... [2024-11-20 14:42:31,895 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:42:31" (1/1) ... [2024-11-20 14:42:31,906 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:42:31" (1/1) ... [2024-11-20 14:42:31,913 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:42:31" (1/1) ... [2024-11-20 14:42:31,915 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:42:31" (1/1) ... [2024-11-20 14:42:31,919 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:42:31" (1/1) ... [2024-11-20 14:42:31,922 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 14:42:31,927 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 14:42:31,927 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 14:42:31,927 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 14:42:31,931 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:42:31" (1/1) ... [2024-11-20 14:42:31,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 14:42:31,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:42:31,970 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 14:42:31,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 14:42:32,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-20 14:42:32,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-20 14:42:32,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-20 14:42:32,027 INFO L130 BoogieDeclarations]: Found specification of procedure parse_input [2024-11-20 14:42:32,027 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_input [2024-11-20 14:42:32,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-20 14:42:32,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 14:42:32,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-20 14:42:32,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-20 14:42:32,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-20 14:42:32,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 14:42:32,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-20 14:42:32,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-20 14:42:32,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-20 14:42:32,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 14:42:32,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-20 14:42:32,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-20 14:42:32,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 14:42:32,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 14:42:32,191 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 14:42:32,193 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 14:42:32,507 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-11-20 14:42:32,508 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 14:42:32,519 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 14:42:32,519 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 14:42:32,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:42:32 BoogieIcfgContainer [2024-11-20 14:42:32,520 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 14:42:32,522 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 14:42:32,522 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 14:42:32,525 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 14:42:32,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:42:31" (1/3) ... [2024-11-20 14:42:32,526 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71f82a59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:42:32, skipping insertion in model container [2024-11-20 14:42:32,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:42:31" (2/3) ... [2024-11-20 14:42:32,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71f82a59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:42:32, skipping insertion in model container [2024-11-20 14:42:32,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:42:32" (3/3) ... [2024-11-20 14:42:32,529 INFO L112 eAbstractionObserver]: Analyzing ICFG bftpd_3.i [2024-11-20 14:42:32,546 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 14:42:32,547 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2024-11-20 14:42:32,622 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 14:42:32,631 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;@ae38ac8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 14:42:32,631 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-11-20 14:42:32,638 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 57 states have internal predecessors, (65), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-20 14:42:32,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-20 14:42:32,647 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:42:32,648 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-20 14:42:32,648 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-11-20 14:42:32,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:42:32,656 INFO L85 PathProgramCache]: Analyzing trace with hash -742866944, now seen corresponding path program 1 times [2024-11-20 14:42:32,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:42:32,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [561947816] [2024-11-20 14:42:32,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:42:32,671 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-11-20 14:42:32,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:42:32,675 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-11-20 14:42:32,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-20 14:42:32,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:32,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 14:42:32,764 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:42:32,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:42:32,914 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:42:32,914 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:42:32,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [561947816] [2024-11-20 14:42:32,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [561947816] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:42:32,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:42:32,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-20 14:42:32,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962082515] [2024-11-20 14:42:32,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:42:32,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:42:32,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:42:32,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:42:32,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:42:32,960 INFO L87 Difference]: Start difference. First operand has 62 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 57 states have internal predecessors, (65), 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.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:42:33,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:42:33,115 INFO L93 Difference]: Finished difference Result 111 states and 129 transitions. [2024-11-20 14:42:33,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:42:33,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-20 14:42:33,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:42:33,126 INFO L225 Difference]: With dead ends: 111 [2024-11-20 14:42:33,126 INFO L226 Difference]: Without dead ends: 107 [2024-11-20 14:42:33,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:42:33,133 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 52 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:42:33,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 103 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:42:33,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-20 14:42:33,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 84. [2024-11-20 14:42:33,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 57 states have (on average 1.6842105263157894) internal successors, (96), 76 states have internal predecessors, (96), 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-11-20 14:42:33,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 109 transitions. [2024-11-20 14:42:33,186 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 109 transitions. Word has length 6 [2024-11-20 14:42:33,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:42:33,186 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 109 transitions. [2024-11-20 14:42:33,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:42:33,186 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 109 transitions. [2024-11-20 14:42:33,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-20 14:42:33,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:42:33,187 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-20 14:42:33,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-20 14:42:33,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-11-20 14:42:33,388 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-11-20 14:42:33,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:42:33,389 INFO L85 PathProgramCache]: Analyzing trace with hash -742866943, now seen corresponding path program 1 times [2024-11-20 14:42:33,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:42:33,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1954348675] [2024-11-20 14:42:33,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:42:33,390 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-11-20 14:42:33,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:42:33,394 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-11-20 14:42:33,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-20 14:42:33,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:33,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-20 14:42:33,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:42:33,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:42:33,580 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:42:33,580 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:42:33,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1954348675] [2024-11-20 14:42:33,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1954348675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:42:33,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:42:33,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:42:33,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003919936] [2024-11-20 14:42:33,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:42:33,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:42:33,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:42:33,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:42:33,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:42:33,584 INFO L87 Difference]: Start difference. First operand 84 states and 109 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:42:33,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:42:33,760 INFO L93 Difference]: Finished difference Result 184 states and 240 transitions. [2024-11-20 14:42:33,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:42:33,761 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-20 14:42:33,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:42:33,764 INFO L225 Difference]: With dead ends: 184 [2024-11-20 14:42:33,764 INFO L226 Difference]: Without dead ends: 184 [2024-11-20 14:42:33,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-11-20 14:42:33,766 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 93 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:42:33,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 145 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:42:33,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-20 14:42:33,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 153. [2024-11-20 14:42:33,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 121 states have (on average 1.7355371900826446) internal successors, (210), 140 states have internal predecessors, (210), 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-11-20 14:42:33,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 236 transitions. [2024-11-20 14:42:33,794 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 236 transitions. Word has length 6 [2024-11-20 14:42:33,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:42:33,795 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 236 transitions. [2024-11-20 14:42:33,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:42:33,795 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 236 transitions. [2024-11-20 14:42:33,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-20 14:42:33,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:42:33,796 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:42:33,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Ended with exit code 0 [2024-11-20 14:42:33,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/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-11-20 14:42:33,999 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-11-20 14:42:34,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:42:34,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1554038803, now seen corresponding path program 1 times [2024-11-20 14:42:34,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:42:34,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [668669643] [2024-11-20 14:42:34,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:42:34,001 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-11-20 14:42:34,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:42:34,004 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/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-11-20 14:42:34,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-20 14:42:34,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:34,068 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 14:42:34,070 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:42:34,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:42:34,208 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:42:34,209 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:42:34,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [668669643] [2024-11-20 14:42:34,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [668669643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:42:34,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:42:34,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:42:34,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748273140] [2024-11-20 14:42:34,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:42:34,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:42:34,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:42:34,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:42:34,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:42:34,211 INFO L87 Difference]: Start difference. First operand 153 states and 236 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-11-20 14:42:34,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:42:34,456 INFO L93 Difference]: Finished difference Result 198 states and 285 transitions. [2024-11-20 14:42:34,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:42:34,457 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-11-20 14:42:34,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:42:34,459 INFO L225 Difference]: With dead ends: 198 [2024-11-20 14:42:34,459 INFO L226 Difference]: Without dead ends: 198 [2024-11-20 14:42:34,459 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-11-20 14:42:34,460 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 67 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:42:34,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 168 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:42:34,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-20 14:42:34,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 156. [2024-11-20 14:42:34,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 124 states have (on average 1.717741935483871) internal successors, (213), 143 states have internal predecessors, (213), 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-11-20 14:42:34,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 239 transitions. [2024-11-20 14:42:34,488 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 239 transitions. Word has length 7 [2024-11-20 14:42:34,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:42:34,488 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 239 transitions. [2024-11-20 14:42:34,489 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-11-20 14:42:34,489 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 239 transitions. [2024-11-20 14:42:34,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-20 14:42:34,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:42:34,489 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:42:34,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-20 14:42:34,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/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-11-20 14:42:34,691 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-11-20 14:42:34,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:42:34,691 INFO L85 PathProgramCache]: Analyzing trace with hash -930562592, now seen corresponding path program 1 times [2024-11-20 14:42:34,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:42:34,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1915881122] [2024-11-20 14:42:34,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:42:34,692 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-11-20 14:42:34,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:42:34,695 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/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-11-20 14:42:34,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-20 14:42:34,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:34,763 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-20 14:42:34,764 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:42:34,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:42:34,959 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:42:34,959 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:42:34,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1915881122] [2024-11-20 14:42:34,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1915881122] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:42:34,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:42:34,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:42:34,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966913753] [2024-11-20 14:42:34,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:42:34,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:42:34,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:42:34,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:42:34,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:42:34,962 INFO L87 Difference]: Start difference. First operand 156 states and 239 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 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-11-20 14:42:35,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:42:35,176 INFO L93 Difference]: Finished difference Result 186 states and 241 transitions. [2024-11-20 14:42:35,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:42:35,177 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 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-11-20 14:42:35,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:42:35,178 INFO L225 Difference]: With dead ends: 186 [2024-11-20 14:42:35,178 INFO L226 Difference]: Without dead ends: 186 [2024-11-20 14:42:35,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-11-20 14:42:35,179 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 90 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:42:35,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 192 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:42:35,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-20 14:42:35,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 156. [2024-11-20 14:42:35,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 124 states have (on average 1.7016129032258065) internal successors, (211), 143 states have internal predecessors, (211), 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-11-20 14:42:35,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 237 transitions. [2024-11-20 14:42:35,193 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 237 transitions. Word has length 8 [2024-11-20 14:42:35,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:42:35,193 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 237 transitions. [2024-11-20 14:42:35,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 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-11-20 14:42:35,193 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 237 transitions. [2024-11-20 14:42:35,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-20 14:42:35,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:42:35,194 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:42:35,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-20 14:42:35,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/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-11-20 14:42:35,397 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-11-20 14:42:35,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:42:35,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1217330767, now seen corresponding path program 1 times [2024-11-20 14:42:35,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:42:35,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1399708705] [2024-11-20 14:42:35,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:42:35,398 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-11-20 14:42:35,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:42:35,400 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/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-11-20 14:42:35,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-20 14:42:35,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:35,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 14:42:35,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:42:35,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:42:35,549 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:42:35,549 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:42:35,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1399708705] [2024-11-20 14:42:35,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1399708705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:42:35,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:42:35,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:42:35,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533865583] [2024-11-20 14:42:35,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:42:35,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:42:35,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:42:35,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:42:35,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:42:35,551 INFO L87 Difference]: Start difference. First operand 156 states and 237 transitions. Second operand has 5 states, 4 states have (on average 2.0) 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-11-20 14:42:35,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:42:35,696 INFO L93 Difference]: Finished difference Result 239 states and 328 transitions. [2024-11-20 14:42:35,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:42:35,698 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) 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-11-20 14:42:35,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:42:35,699 INFO L225 Difference]: With dead ends: 239 [2024-11-20 14:42:35,699 INFO L226 Difference]: Without dead ends: 239 [2024-11-20 14:42:35,700 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-11-20 14:42:35,701 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 172 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:42:35,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 171 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:42:35,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-11-20 14:42:35,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 190. [2024-11-20 14:42:35,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 156 states have (on average 1.6538461538461537) internal successors, (258), 176 states have internal predecessors, (258), 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-11-20 14:42:35,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 284 transitions. [2024-11-20 14:42:35,714 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 284 transitions. Word has length 9 [2024-11-20 14:42:35,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:42:35,714 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 284 transitions. [2024-11-20 14:42:35,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) 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-11-20 14:42:35,715 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 284 transitions. [2024-11-20 14:42:35,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-20 14:42:35,715 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:42:35,715 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:42:35,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-20 14:42:35,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/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-11-20 14:42:35,917 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-11-20 14:42:35,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:42:35,917 INFO L85 PathProgramCache]: Analyzing trace with hash -917451838, now seen corresponding path program 1 times [2024-11-20 14:42:35,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:42:35,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1730249417] [2024-11-20 14:42:35,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:42:35,918 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-11-20 14:42:35,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:42:35,919 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/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-11-20 14:42:35,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-20 14:42:35,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:35,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 14:42:35,977 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:42:36,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:42:36,080 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:42:36,080 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:42:36,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1730249417] [2024-11-20 14:42:36,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1730249417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:42:36,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:42:36,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:42:36,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145285325] [2024-11-20 14:42:36,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:42:36,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:42:36,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:42:36,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:42:36,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:42:36,081 INFO L87 Difference]: Start difference. First operand 190 states and 284 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:42:36,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:42:36,245 INFO L93 Difference]: Finished difference Result 240 states and 307 transitions. [2024-11-20 14:42:36,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:42:36,245 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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 10 [2024-11-20 14:42:36,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:42:36,247 INFO L225 Difference]: With dead ends: 240 [2024-11-20 14:42:36,247 INFO L226 Difference]: Without dead ends: 240 [2024-11-20 14:42:36,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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-11-20 14:42:36,248 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 183 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:42:36,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 198 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:42:36,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-11-20 14:42:36,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 204. [2024-11-20 14:42:36,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 169 states have (on average 1.650887573964497) internal successors, (279), 190 states have internal predecessors, (279), 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-11-20 14:42:36,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 305 transitions. [2024-11-20 14:42:36,261 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 305 transitions. Word has length 10 [2024-11-20 14:42:36,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:42:36,261 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 305 transitions. [2024-11-20 14:42:36,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:42:36,261 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 305 transitions. [2024-11-20 14:42:36,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-20 14:42:36,262 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:42:36,262 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:42:36,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-20 14:42:36,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/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-11-20 14:42:36,463 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-11-20 14:42:36,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:42:36,463 INFO L85 PathProgramCache]: Analyzing trace with hash -657083128, now seen corresponding path program 1 times [2024-11-20 14:42:36,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:42:36,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [353674449] [2024-11-20 14:42:36,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:42:36,464 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-11-20 14:42:36,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:42:36,466 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/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-11-20 14:42:36,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-20 14:42:36,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:36,520 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 14:42:36,521 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:42:36,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:42:36,717 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:42:36,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:42:36,961 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:42:36,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [353674449] [2024-11-20 14:42:36,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [353674449] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:42:36,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:42:36,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2024-11-20 14:42:36,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984794066] [2024-11-20 14:42:36,962 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:42:36,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 14:42:36,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:42:36,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 14:42:36,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-20 14:42:36,963 INFO L87 Difference]: Start difference. First operand 204 states and 305 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 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-11-20 14:42:37,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:42:37,353 INFO L93 Difference]: Finished difference Result 275 states and 362 transitions. [2024-11-20 14:42:37,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 14:42:37,353 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 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-11-20 14:42:37,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:42:37,355 INFO L225 Difference]: With dead ends: 275 [2024-11-20 14:42:37,355 INFO L226 Difference]: Without dead ends: 275 [2024-11-20 14:42:37,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 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-11-20 14:42:37,356 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 229 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:42:37,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 223 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 14:42:37,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-20 14:42:37,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 234. [2024-11-20 14:42:37,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 199 states have (on average 1.64321608040201) internal successors, (327), 220 states have internal predecessors, (327), 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-11-20 14:42:37,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 353 transitions. [2024-11-20 14:42:37,370 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 353 transitions. Word has length 14 [2024-11-20 14:42:37,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:42:37,370 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 353 transitions. [2024-11-20 14:42:37,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 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-11-20 14:42:37,371 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 353 transitions. [2024-11-20 14:42:37,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-20 14:42:37,371 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:42:37,371 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:42:37,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-20 14:42:37,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/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-11-20 14:42:37,575 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-11-20 14:42:37,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:42:37,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1105259462, now seen corresponding path program 1 times [2024-11-20 14:42:37,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:42:37,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1519990911] [2024-11-20 14:42:37,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:42:37,577 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-11-20 14:42:37,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:42:37,580 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/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-11-20 14:42:37,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-20 14:42:37,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:37,652 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-20 14:42:37,654 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:42:37,866 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:42:37,867 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:42:37,993 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:42:37,994 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:42:37,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1519990911] [2024-11-20 14:42:37,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1519990911] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:42:37,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:42:37,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2024-11-20 14:42:37,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859967906] [2024-11-20 14:42:37,995 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:42:37,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 14:42:37,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:42:37,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 14:42:37,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-20 14:42:37,996 INFO L87 Difference]: Start difference. First operand 234 states and 353 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-11-20 14:42:38,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:42:38,506 INFO L93 Difference]: Finished difference Result 293 states and 419 transitions. [2024-11-20 14:42:38,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 14:42:38,507 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-11-20 14:42:38,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:42:38,509 INFO L225 Difference]: With dead ends: 293 [2024-11-20 14:42:38,509 INFO L226 Difference]: Without dead ends: 293 [2024-11-20 14:42:38,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-11-20 14:42:38,510 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 81 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 14:42:38,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 346 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 14:42:38,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-20 14:42:38,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 244. [2024-11-20 14:42:38,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 209 states have (on average 1.6363636363636365) internal successors, (342), 230 states have internal predecessors, (342), 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-11-20 14:42:38,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 368 transitions. [2024-11-20 14:42:38,531 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 368 transitions. Word has length 15 [2024-11-20 14:42:38,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:42:38,531 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 368 transitions. [2024-11-20 14:42:38,531 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-11-20 14:42:38,531 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 368 transitions. [2024-11-20 14:42:38,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-20 14:42:38,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:42:38,532 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:42:38,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-20 14:42:38,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/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-11-20 14:42:38,737 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-11-20 14:42:38,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:42:38,738 INFO L85 PathProgramCache]: Analyzing trace with hash -96695001, now seen corresponding path program 1 times [2024-11-20 14:42:38,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:42:38,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [744849091] [2024-11-20 14:42:38,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:42:38,738 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-11-20 14:42:38,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:42:38,739 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/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-11-20 14:42:38,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-20 14:42:38,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:38,812 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-20 14:42:38,813 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:42:39,090 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:42:39,090 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:42:39,259 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:42:39,259 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:42:39,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [744849091] [2024-11-20 14:42:39,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [744849091] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:42:39,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:42:39,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2024-11-20 14:42:39,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69613517] [2024-11-20 14:42:39,260 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:42:39,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 14:42:39,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:42:39,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 14:42:39,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-20 14:42:39,261 INFO L87 Difference]: Start difference. First operand 244 states and 368 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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-11-20 14:42:39,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:42:39,981 INFO L93 Difference]: Finished difference Result 401 states and 529 transitions. [2024-11-20 14:42:39,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 14:42:39,982 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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 16 [2024-11-20 14:42:39,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:42:39,984 INFO L225 Difference]: With dead ends: 401 [2024-11-20 14:42:39,984 INFO L226 Difference]: Without dead ends: 401 [2024-11-20 14:42:39,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 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-11-20 14:42:39,985 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 250 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 14:42:39,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 443 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 14:42:39,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-11-20 14:42:39,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 313. [2024-11-20 14:42:39,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 275 states have (on average 1.6472727272727272) internal successors, (453), 297 states have internal predecessors, (453), 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-11-20 14:42:39,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 485 transitions. [2024-11-20 14:42:39,999 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 485 transitions. Word has length 16 [2024-11-20 14:42:39,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:42:40,000 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 485 transitions. [2024-11-20 14:42:40,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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-11-20 14:42:40,000 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 485 transitions. [2024-11-20 14:42:40,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-20 14:42:40,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:42:40,001 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:42:40,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-20 14:42:40,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/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-11-20 14:42:40,202 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-11-20 14:42:40,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:42:40,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1930496567, now seen corresponding path program 1 times [2024-11-20 14:42:40,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:42:40,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1298436042] [2024-11-20 14:42:40,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:42:40,203 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-11-20 14:42:40,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:42:40,205 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/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-11-20 14:42:40,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-20 14:42:40,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:40,256 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 14:42:40,258 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:42:40,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:42:40,297 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:42:40,297 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:42:40,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1298436042] [2024-11-20 14:42:40,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1298436042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:42:40,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:42:40,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-20 14:42:40,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582538334] [2024-11-20 14:42:40,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:42:40,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:42:40,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:42:40,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:42:40,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:42:40,301 INFO L87 Difference]: Start difference. First operand 313 states and 485 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:42:40,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:42:40,327 INFO L93 Difference]: Finished difference Result 457 states and 705 transitions. [2024-11-20 14:42:40,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:42:40,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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 18 [2024-11-20 14:42:40,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:42:40,330 INFO L225 Difference]: With dead ends: 457 [2024-11-20 14:42:40,330 INFO L226 Difference]: Without dead ends: 457 [2024-11-20 14:42:40,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:42:40,331 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 50 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:42:40,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 109 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:42:40,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2024-11-20 14:42:40,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 437. [2024-11-20 14:42:40,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 390 states have (on average 1.6435897435897435) internal successors, (641), 414 states have internal predecessors, (641), 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-11-20 14:42:40,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 697 transitions. [2024-11-20 14:42:40,355 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 697 transitions. Word has length 18 [2024-11-20 14:42:40,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:42:40,356 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 697 transitions. [2024-11-20 14:42:40,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:42:40,356 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 697 transitions. [2024-11-20 14:42:40,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-20 14:42:40,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:42:40,357 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:42:40,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-20 14:42:40,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/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-11-20 14:42:40,558 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-11-20 14:42:40,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:42:40,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1930496311, now seen corresponding path program 1 times [2024-11-20 14:42:40,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:42:40,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [435552424] [2024-11-20 14:42:40,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:42:40,559 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-11-20 14:42:40,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:42:40,560 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/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-11-20 14:42:40,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-20 14:42:40,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:40,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-20 14:42:40,619 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:42:40,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:42:40,685 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:42:40,686 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:42:40,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [435552424] [2024-11-20 14:42:40,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [435552424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:42:40,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:42:40,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:42:40,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91879828] [2024-11-20 14:42:40,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:42:40,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:42:40,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:42:40,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:42:40,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:42:40,688 INFO L87 Difference]: Start difference. First operand 437 states and 697 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:42:40,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:42:40,724 INFO L93 Difference]: Finished difference Result 485 states and 745 transitions. [2024-11-20 14:42:40,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:42:40,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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 18 [2024-11-20 14:42:40,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:42:40,727 INFO L225 Difference]: With dead ends: 485 [2024-11-20 14:42:40,727 INFO L226 Difference]: Without dead ends: 485 [2024-11-20 14:42:40,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:42:40,727 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 35 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:42:40,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 110 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:42:40,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2024-11-20 14:42:40,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 469. [2024-11-20 14:42:40,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 419 states have (on average 1.6252983293556087) internal successors, (681), 444 states have internal predecessors, (681), 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-11-20 14:42:40,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 741 transitions. [2024-11-20 14:42:40,740 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 741 transitions. Word has length 18 [2024-11-20 14:42:40,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:42:40,740 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 741 transitions. [2024-11-20 14:42:40,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:42:40,741 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 741 transitions. [2024-11-20 14:42:40,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-20 14:42:40,741 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:42:40,741 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:42:40,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-20 14:42:40,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/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-11-20 14:42:40,942 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-11-20 14:42:40,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:42:40,943 INFO L85 PathProgramCache]: Analyzing trace with hash 284148639, now seen corresponding path program 1 times [2024-11-20 14:42:40,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:42:40,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1284791314] [2024-11-20 14:42:40,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:42:40,943 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-11-20 14:42:40,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:42:40,945 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/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-11-20 14:42:40,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-20 14:42:40,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:40,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 14:42:40,997 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:42:41,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:42:41,071 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:42:41,071 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:42:41,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1284791314] [2024-11-20 14:42:41,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1284791314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:42:41,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:42:41,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-20 14:42:41,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652574019] [2024-11-20 14:42:41,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:42:41,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:42:41,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:42:41,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:42:41,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:42:41,073 INFO L87 Difference]: Start difference. First operand 469 states and 741 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:42:41,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:42:41,125 INFO L93 Difference]: Finished difference Result 484 states and 741 transitions. [2024-11-20 14:42:41,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:42:41,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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 19 [2024-11-20 14:42:41,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:42:41,128 INFO L225 Difference]: With dead ends: 484 [2024-11-20 14:42:41,128 INFO L226 Difference]: Without dead ends: 484 [2024-11-20 14:42:41,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:42:41,129 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 32 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:42:41,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 111 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:42:41,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2024-11-20 14:42:41,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 469. [2024-11-20 14:42:41,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 419 states have (on average 1.6157517899761336) internal successors, (677), 444 states have internal predecessors, (677), 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-11-20 14:42:41,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 737 transitions. [2024-11-20 14:42:41,147 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 737 transitions. Word has length 19 [2024-11-20 14:42:41,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:42:41,147 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 737 transitions. [2024-11-20 14:42:41,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:42:41,147 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 737 transitions. [2024-11-20 14:42:41,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-20 14:42:41,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:42:41,148 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-11-20 14:42:41,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-20 14:42:41,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/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-11-20 14:42:41,349 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-11-20 14:42:41,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:42:41,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1911770353, now seen corresponding path program 2 times [2024-11-20 14:42:41,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:42:41,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1564709106] [2024-11-20 14:42:41,350 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 14:42:41,350 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-11-20 14:42:41,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:42:41,354 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/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-11-20 14:42:41,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-20 14:42:41,413 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 14:42:41,413 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 14:42:41,418 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-20 14:42:41,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:42:41,627 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:42:41,627 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:42:42,092 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:42:42,092 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:42:42,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1564709106] [2024-11-20 14:42:42,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1564709106] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:42:42,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:42:42,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2024-11-20 14:42:42,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55536658] [2024-11-20 14:42:42,093 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:42:42,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 14:42:42,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:42:42,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 14:42:42,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-20 14:42:42,095 INFO L87 Difference]: Start difference. First operand 469 states and 737 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 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-11-20 14:42:42,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:42:42,780 INFO L93 Difference]: Finished difference Result 547 states and 827 transitions. [2024-11-20 14:42:42,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 14:42:42,781 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 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 22 [2024-11-20 14:42:42,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:42:42,783 INFO L225 Difference]: With dead ends: 547 [2024-11-20 14:42:42,783 INFO L226 Difference]: Without dead ends: 547 [2024-11-20 14:42:42,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 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-11-20 14:42:42,784 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 188 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 14:42:42,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 303 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 14:42:42,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2024-11-20 14:42:42,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 500. [2024-11-20 14:42:42,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 450 states have (on average 1.6155555555555556) internal successors, (727), 475 states have internal predecessors, (727), 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-11-20 14:42:42,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 787 transitions. [2024-11-20 14:42:42,801 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 787 transitions. Word has length 22 [2024-11-20 14:42:42,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:42:42,802 INFO L471 AbstractCegarLoop]: Abstraction has 500 states and 787 transitions. [2024-11-20 14:42:42,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 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-11-20 14:42:42,802 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 787 transitions. [2024-11-20 14:42:42,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-20 14:42:42,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:42:42,804 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-11-20 14:42:42,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-20 14:42:43,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/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-11-20 14:42:43,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-11-20 14:42:43,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:42:43,008 INFO L85 PathProgramCache]: Analyzing trace with hash 373919402, now seen corresponding path program 1 times [2024-11-20 14:42:43,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:42:43,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1983214319] [2024-11-20 14:42:43,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:42:43,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-11-20 14:42:43,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:42:43,012 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/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-11-20 14:42:43,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-20 14:42:43,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:43,072 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 14:42:43,073 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:42:43,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:42:43,078 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:42:43,079 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:42:43,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1983214319] [2024-11-20 14:42:43,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1983214319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:42:43,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:42:43,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:42:43,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379518722] [2024-11-20 14:42:43,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:42:43,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:42:43,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:42:43,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:42:43,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:42:43,081 INFO L87 Difference]: Start difference. First operand 500 states and 787 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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-11-20 14:42:43,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:42:43,089 INFO L93 Difference]: Finished difference Result 350 states and 526 transitions. [2024-11-20 14:42:43,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:42:43,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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-11-20 14:42:43,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:42:43,093 INFO L225 Difference]: With dead ends: 350 [2024-11-20 14:42:43,093 INFO L226 Difference]: Without dead ends: 350 [2024-11-20 14:42:43,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:42:43,094 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 3 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:42:43,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 126 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:42:43,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-11-20 14:42:43,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 349. [2024-11-20 14:42:43,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 308 states have (on average 1.5876623376623376) internal successors, (489), 331 states have internal predecessors, (489), 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-11-20 14:42:43,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 525 transitions. [2024-11-20 14:42:43,103 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 525 transitions. Word has length 25 [2024-11-20 14:42:43,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:42:43,103 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 525 transitions. [2024-11-20 14:42:43,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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-11-20 14:42:43,103 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 525 transitions. [2024-11-20 14:42:43,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-20 14:42:43,104 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:42:43,104 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, 1] [2024-11-20 14:42:43,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Forceful destruction successful, exit code 0 [2024-11-20 14:42:43,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/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-11-20 14:42:43,306 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-11-20 14:42:43,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:42:43,306 INFO L85 PathProgramCache]: Analyzing trace with hash 70513582, now seen corresponding path program 1 times [2024-11-20 14:42:43,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:42:43,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1455978027] [2024-11-20 14:42:43,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:42:43,307 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-11-20 14:42:43,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:42:43,310 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/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-11-20 14:42:43,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-20 14:42:43,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:43,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-20 14:42:43,401 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:42:43,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:42:43,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-20 14:42:43,805 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:42:43,806 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:42:44,088 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:42:44,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1455978027] [2024-11-20 14:42:44,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1455978027] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:42:44,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [682017586] [2024-11-20 14:42:44,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:42:44,089 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 14:42:44,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 14:42:44,093 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-20 14:42:44,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2024-11-20 14:42:44,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:44,272 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-20 14:42:44,274 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:42:44,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:42:44,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-20 14:42:44,549 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:42:44,550 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:42:44,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [682017586] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:42:44,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:42:44,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2024-11-20 14:42:44,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129941628] [2024-11-20 14:42:44,976 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:42:44,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 14:42:44,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:42:44,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 14:42:44,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-20 14:42:44,977 INFO L87 Difference]: Start difference. First operand 349 states and 525 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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-11-20 14:42:45,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:42:45,454 INFO L93 Difference]: Finished difference Result 375 states and 521 transitions. [2024-11-20 14:42:45,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 14:42:45,455 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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-11-20 14:42:45,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:42:45,457 INFO L225 Difference]: With dead ends: 375 [2024-11-20 14:42:45,457 INFO L226 Difference]: Without dead ends: 375 [2024-11-20 14:42:45,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2024-11-20 14:42:45,458 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 137 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:42:45,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 122 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 14:42:45,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-11-20 14:42:45,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 363. [2024-11-20 14:42:45,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 319 states have (on average 1.4764890282131662) internal successors, (471), 343 states have internal predecessors, (471), 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-11-20 14:42:45,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 514 transitions. [2024-11-20 14:42:45,467 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 514 transitions. Word has length 27 [2024-11-20 14:42:45,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:42:45,469 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 514 transitions. [2024-11-20 14:42:45,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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-11-20 14:42:45,469 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 514 transitions. [2024-11-20 14:42:45,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-20 14:42:45,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:42:45,470 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, 1, 1] [2024-11-20 14:42:45,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-20 14:42:45,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2024-11-20 14:42:45,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-20 14:42:45,871 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-11-20 14:42:45,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:42:45,871 INFO L85 PathProgramCache]: Analyzing trace with hash -263999033, now seen corresponding path program 1 times [2024-11-20 14:42:45,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:42:45,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [392216608] [2024-11-20 14:42:45,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:42:45,872 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 14:42:45,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:42:45,873 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/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-11-20 14:42:45,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-20 14:42:45,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:45,942 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 14:42:45,944 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:42:46,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:42:46,078 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:42:46,078 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:42:46,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [392216608] [2024-11-20 14:42:46,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [392216608] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:42:46,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:42:46,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:42:46,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268435685] [2024-11-20 14:42:46,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:42:46,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 14:42:46,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:42:46,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 14:42:46,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:42:46,080 INFO L87 Difference]: Start difference. First operand 363 states and 514 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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-11-20 14:42:46,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:42:46,173 INFO L93 Difference]: Finished difference Result 384 states and 531 transitions. [2024-11-20 14:42:46,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 14:42:46,174 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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 28 [2024-11-20 14:42:46,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:42:46,176 INFO L225 Difference]: With dead ends: 384 [2024-11-20 14:42:46,176 INFO L226 Difference]: Without dead ends: 384 [2024-11-20 14:42:46,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:42:46,177 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 69 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:42:46,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 189 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:42:46,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2024-11-20 14:42:46,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 374. [2024-11-20 14:42:46,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 330 states have (on average 1.4606060606060607) internal successors, (482), 354 states have internal predecessors, (482), 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-11-20 14:42:46,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 525 transitions. [2024-11-20 14:42:46,187 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 525 transitions. Word has length 28 [2024-11-20 14:42:46,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:42:46,188 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 525 transitions. [2024-11-20 14:42:46,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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-11-20 14:42:46,188 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 525 transitions. [2024-11-20 14:42:46,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-20 14:42:46,189 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:42:46,189 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, 1, 1] [2024-11-20 14:42:46,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-20 14:42:46,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/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-11-20 14:42:46,393 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-11-20 14:42:46,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:42:46,393 INFO L85 PathProgramCache]: Analyzing trace with hash -955925939, now seen corresponding path program 1 times [2024-11-20 14:42:46,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:42:46,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2361753] [2024-11-20 14:42:46,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:42:46,394 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-11-20 14:42:46,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:42:46,395 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/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-11-20 14:42:46,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-20 14:42:46,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:46,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-20 14:42:46,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:42:46,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:42:46,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-20 14:42:46,970 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:42:46,971 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:42:51,216 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:42:51,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2361753] [2024-11-20 14:42:51,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2361753] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:42:51,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [122544564] [2024-11-20 14:42:51,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:42:51,217 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 14:42:51,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 14:42:51,218 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-20 14:42:51,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2024-11-20 14:42:51,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:51,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-20 14:42:51,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:42:51,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:42:51,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-20 14:42:51,937 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:42:51,937 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:42:56,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [122544564] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:42:56,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:42:56,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 7 [2024-11-20 14:42:56,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274530169] [2024-11-20 14:42:56,091 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:42:56,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 14:42:56,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:42:56,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 14:42:56,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=123, Unknown=1, NotChecked=0, Total=156 [2024-11-20 14:42:56,092 INFO L87 Difference]: Start difference. First operand 374 states and 525 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 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-11-20 14:42:56,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:42:56,780 INFO L93 Difference]: Finished difference Result 383 states and 525 transitions. [2024-11-20 14:42:56,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 14:42:56,780 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 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 29 [2024-11-20 14:42:56,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:42:56,782 INFO L225 Difference]: With dead ends: 383 [2024-11-20 14:42:56,782 INFO L226 Difference]: Without dead ends: 383 [2024-11-20 14:42:56,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=143, Invalid=362, Unknown=1, NotChecked=0, Total=506 [2024-11-20 14:42:56,783 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 214 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:42:56,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 172 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 14:42:56,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-11-20 14:42:56,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 375. [2024-11-20 14:42:56,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 331 states have (on average 1.444108761329305) internal successors, (478), 355 states have internal predecessors, (478), 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-11-20 14:42:56,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 521 transitions. [2024-11-20 14:42:56,792 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 521 transitions. Word has length 29 [2024-11-20 14:42:56,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:42:56,792 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 521 transitions. [2024-11-20 14:42:56,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 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-11-20 14:42:56,792 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 521 transitions. [2024-11-20 14:42:56,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-20 14:42:56,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:42:56,793 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:42:56,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Ended with exit code 0 [2024-11-20 14:42:56,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Forceful destruction successful, exit code 0 [2024-11-20 14:42:57,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,19 /storage/repos/ultimate/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-11-20 14:42:57,194 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-11-20 14:42:57,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:42:57,195 INFO L85 PathProgramCache]: Analyzing trace with hash 431067010, now seen corresponding path program 1 times [2024-11-20 14:42:57,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:42:57,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [55157903] [2024-11-20 14:42:57,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:42:57,195 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-11-20 14:42:57,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:42:57,196 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/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-11-20 14:42:57,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-20 14:42:57,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:57,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-20 14:42:57,280 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:42:57,347 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-11-20 14:42:57,404 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-20 14:42:57,404 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-11-20 14:42:57,479 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:42:57,479 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:42:57,761 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:42:57,761 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:42:57,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [55157903] [2024-11-20 14:42:57,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [55157903] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:42:57,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:42:57,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2024-11-20 14:42:57,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45955226] [2024-11-20 14:42:57,762 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:42:57,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 14:42:57,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:42:57,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 14:42:57,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=50, Unknown=1, NotChecked=14, Total=90 [2024-11-20 14:42:57,763 INFO L87 Difference]: Start difference. First operand 375 states and 521 transitions. Second operand has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 7 states have internal predecessors, (52), 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-11-20 14:42:58,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:42:58,309 INFO L93 Difference]: Finished difference Result 530 states and 678 transitions. [2024-11-20 14:42:58,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 14:42:58,309 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 7 states have internal predecessors, (52), 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 30 [2024-11-20 14:42:58,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:42:58,311 INFO L225 Difference]: With dead ends: 530 [2024-11-20 14:42:58,311 INFO L226 Difference]: Without dead ends: 530 [2024-11-20 14:42:58,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 47 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-11-20 14:42:58,312 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 276 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 184 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 14:42:58,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 290 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 237 Invalid, 0 Unknown, 184 Unchecked, 0.4s Time] [2024-11-20 14:42:58,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2024-11-20 14:42:58,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 460. [2024-11-20 14:42:58,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 413 states have (on average 1.397094430992736) internal successors, (577), 438 states have internal predecessors, (577), 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-11-20 14:42:58,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 619 transitions. [2024-11-20 14:42:58,323 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 619 transitions. Word has length 30 [2024-11-20 14:42:58,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:42:58,324 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 619 transitions. [2024-11-20 14:42:58,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 7 states have internal predecessors, (52), 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-11-20 14:42:58,325 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 619 transitions. [2024-11-20 14:42:58,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-20 14:42:58,326 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:42:58,326 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:42:58,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Forceful destruction successful, exit code 0 [2024-11-20 14:42:58,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/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-11-20 14:42:58,527 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-11-20 14:42:58,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:42:58,528 INFO L85 PathProgramCache]: Analyzing trace with hash 478175471, now seen corresponding path program 1 times [2024-11-20 14:42:58,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:42:58,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [923618092] [2024-11-20 14:42:58,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:42:58,528 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-11-20 14:42:58,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:42:58,530 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/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-11-20 14:42:58,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-20 14:42:58,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:58,624 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-20 14:42:58,626 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:42:58,741 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-11-20 14:42:58,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:42:58,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-20 14:42:58,898 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:42:58,898 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:42:59,084 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:42:59,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [923618092] [2024-11-20 14:42:59,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [923618092] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:42:59,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [428343338] [2024-11-20 14:42:59,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:42:59,085 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 14:42:59,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 14:42:59,086 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-20 14:42:59,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2024-11-20 14:42:59,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:59,244 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-20 14:42:59,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:42:59,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:42:59,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-20 14:42:59,487 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:42:59,487 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:42:59,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [428343338] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:42:59,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:42:59,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2024-11-20 14:42:59,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656230639] [2024-11-20 14:42:59,624 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:42:59,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 14:42:59,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:42:59,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 14:42:59,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=82, Unknown=1, NotChecked=18, Total=132 [2024-11-20 14:42:59,625 INFO L87 Difference]: Start difference. First operand 460 states and 619 transitions. Second operand has 8 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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-11-20 14:43:00,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:43:00,124 INFO L93 Difference]: Finished difference Result 629 states and 777 transitions. [2024-11-20 14:43:00,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 14:43:00,124 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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 31 [2024-11-20 14:43:00,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:43:00,127 INFO L225 Difference]: With dead ends: 629 [2024-11-20 14:43:00,127 INFO L226 Difference]: Without dead ends: 629 [2024-11-20 14:43:00,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=291, Unknown=1, NotChecked=38, Total=462 [2024-11-20 14:43:00,127 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 380 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 232 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:43:00,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 208 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 162 Invalid, 0 Unknown, 232 Unchecked, 0.3s Time] [2024-11-20 14:43:00,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2024-11-20 14:43:00,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 556. [2024-11-20 14:43:00,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 506 states have (on average 1.3715415019762847) internal successors, (694), 533 states have internal predecessors, (694), 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-11-20 14:43:00,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 732 transitions. [2024-11-20 14:43:00,139 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 732 transitions. Word has length 31 [2024-11-20 14:43:00,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:43:00,140 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 732 transitions. [2024-11-20 14:43:00,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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-11-20 14:43:00,140 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 732 transitions. [2024-11-20 14:43:00,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-20 14:43:00,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:43:00,141 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, 1] [2024-11-20 14:43:00,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Forceful destruction successful, exit code 0 [2024-11-20 14:43:00,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Forceful destruction successful, exit code 0 [2024-11-20 14:43:00,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,22 /storage/repos/ultimate/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-11-20 14:43:00,542 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-11-20 14:43:00,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:43:00,542 INFO L85 PathProgramCache]: Analyzing trace with hash 850193333, now seen corresponding path program 1 times [2024-11-20 14:43:00,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:43:00,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [309722632] [2024-11-20 14:43:00,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:43:00,543 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-11-20 14:43:00,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:43:00,544 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/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-11-20 14:43:00,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (24)] Waiting until timeout for monitored process [2024-11-20 14:43:00,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:43:00,625 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-20 14:43:00,626 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:43:00,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:43:00,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-20 14:43:01,089 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:43:01,089 INFO L311 TraceCheckSpWp]: Computing backward predicates...