./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 15cc89c7e1960c2febb69088039cfa5518d1d373f8e6bef80768aca87eabe926 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 05:13:55,838 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 05:13:55,925 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 05:13:55,934 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 05:13:55,935 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 05:13:55,966 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 05:13:55,967 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 05:13:55,967 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 05:13:55,968 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 05:13:55,968 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 05:13:55,969 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 05:13:55,969 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 05:13:55,970 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 05:13:55,970 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 05:13:55,970 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 05:13:55,971 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 05:13:55,971 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 05:13:55,972 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 05:13:55,972 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 05:13:55,972 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 05:13:55,973 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 05:13:55,974 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 05:13:55,974 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 05:13:55,974 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 05:13:55,974 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 05:13:55,975 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 05:13:55,975 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 05:13:55,975 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 05:13:55,976 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 05:13:55,976 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 05:13:55,976 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 05:13:55,977 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 05:13:55,977 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:13:55,977 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 05:13:55,977 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 05:13:55,978 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 05:13:55,978 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 05:13:55,978 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 05:13:55,978 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 05:13:55,979 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 05:13:55,979 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 05:13:55,979 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 05:13:55,979 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 ! call(reach_error())) ) 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 -> 15cc89c7e1960c2febb69088039cfa5518d1d373f8e6bef80768aca87eabe926 [2024-10-13 05:13:56,272 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 05:13:56,300 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 05:13:56,304 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 05:13:56,305 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 05:13:56,306 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 05:13:56,307 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-2.i [2024-10-13 05:13:57,711 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 05:13:57,950 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 05:13:57,950 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-2.i [2024-10-13 05:13:57,960 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23060d792/61b3b31bd5f4417cb96188207710048b/FLAG6efa038e0 [2024-10-13 05:13:57,980 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23060d792/61b3b31bd5f4417cb96188207710048b [2024-10-13 05:13:57,983 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 05:13:57,985 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 05:13:57,986 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 05:13:57,987 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 05:13:57,993 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 05:13:57,994 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:13:57" (1/1) ... [2024-10-13 05:13:57,997 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@709585ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:13:57, skipping insertion in model container [2024-10-13 05:13:57,997 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:13:57" (1/1) ... [2024-10-13 05:13:58,024 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 05:13:58,206 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-2.i[914,927] [2024-10-13 05:13:58,252 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:13:58,275 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 05:13:58,290 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-2.i[914,927] [2024-10-13 05:13:58,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:13:58,331 INFO L204 MainTranslator]: Completed translation [2024-10-13 05:13:58,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:13:58 WrapperNode [2024-10-13 05:13:58,331 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 05:13:58,332 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 05:13:58,333 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 05:13:58,334 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 05:13:58,340 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:13:58" (1/1) ... [2024-10-13 05:13:58,349 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:13:58" (1/1) ... [2024-10-13 05:13:58,381 INFO L138 Inliner]: procedures = 26, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 83 [2024-10-13 05:13:58,381 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 05:13:58,382 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 05:13:58,382 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 05:13:58,383 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 05:13:58,396 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:13:58" (1/1) ... [2024-10-13 05:13:58,397 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:13:58" (1/1) ... [2024-10-13 05:13:58,399 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:13:58" (1/1) ... [2024-10-13 05:13:58,415 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 05:13:58,415 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:13:58" (1/1) ... [2024-10-13 05:13:58,415 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:13:58" (1/1) ... [2024-10-13 05:13:58,420 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:13:58" (1/1) ... [2024-10-13 05:13:58,423 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:13:58" (1/1) ... [2024-10-13 05:13:58,425 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:13:58" (1/1) ... [2024-10-13 05:13:58,427 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:13:58" (1/1) ... [2024-10-13 05:13:58,430 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 05:13:58,432 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 05:13:58,432 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 05:13:58,432 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 05:13:58,433 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:13:58" (1/1) ... [2024-10-13 05:13:58,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:13:58,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:13:58,494 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 05:13:58,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 05:13:58,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 05:13:58,551 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 05:13:58,552 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 05:13:58,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 05:13:58,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 05:13:58,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 05:13:58,632 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 05:13:58,635 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 05:13:58,960 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-13 05:13:58,960 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 05:13:59,014 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 05:13:59,019 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 05:13:59,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:13:59 BoogieIcfgContainer [2024-10-13 05:13:59,020 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 05:13:59,022 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 05:13:59,022 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 05:13:59,025 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 05:13:59,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 05:13:57" (1/3) ... [2024-10-13 05:13:59,027 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71236de2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:13:59, skipping insertion in model container [2024-10-13 05:13:59,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:13:58" (2/3) ... [2024-10-13 05:13:59,028 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71236de2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:13:59, skipping insertion in model container [2024-10-13 05:13:59,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:13:59" (3/3) ... [2024-10-13 05:13:59,030 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-2.i [2024-10-13 05:13:59,045 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 05:13:59,046 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 05:13:59,114 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 05:13:59,121 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=LoopHeads, 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;@47246ef6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 05:13:59,122 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 05:13:59,126 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-13 05:13:59,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-13 05:13:59,137 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:13:59,139 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:13:59,139 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:13:59,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:13:59,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1099332257, now seen corresponding path program 1 times [2024-10-13 05:13:59,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:13:59,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142755534] [2024-10-13 05:13:59,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:13:59,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:13:59,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:13:59,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:13:59,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:13:59,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:13:59,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:13:59,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:13:59,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:13:59,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:13:59,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:13:59,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:13:59,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:13:59,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:13:59,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:13:59,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:13:59,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:13:59,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:13:59,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:13:59,572 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-13 05:13:59,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:13:59,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142755534] [2024-10-13 05:13:59,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142755534] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:13:59,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:13:59,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 05:13:59,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393441392] [2024-10-13 05:13:59,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:13:59,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 05:13:59,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:13:59,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 05:13:59,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:13:59,612 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-13 05:13:59,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:13:59,658 INFO L93 Difference]: Finished difference Result 63 states and 104 transitions. [2024-10-13 05:13:59,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 05:13:59,666 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 54 [2024-10-13 05:13:59,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:13:59,674 INFO L225 Difference]: With dead ends: 63 [2024-10-13 05:13:59,674 INFO L226 Difference]: Without dead ends: 31 [2024-10-13 05:13:59,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:13:59,685 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 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-10-13 05:13:59,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:13:59,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-13 05:13:59,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-10-13 05:13:59,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-13 05:13:59,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2024-10-13 05:13:59,726 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 44 transitions. Word has length 54 [2024-10-13 05:13:59,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:13:59,727 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 44 transitions. [2024-10-13 05:13:59,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-13 05:13:59,728 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 44 transitions. [2024-10-13 05:13:59,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-13 05:13:59,732 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:13:59,733 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:13:59,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 05:13:59,733 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:13:59,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:13:59,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1927738719, now seen corresponding path program 1 times [2024-10-13 05:13:59,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:13:59,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846741007] [2024-10-13 05:13:59,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:13:59,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:13:59,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:00,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:14:00,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:00,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:14:00,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:00,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:14:00,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:00,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:14:00,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:00,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:14:00,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:00,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:14:00,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:00,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:14:00,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:00,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:14:00,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:00,517 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-13 05:14:00,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:14:00,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846741007] [2024-10-13 05:14:00,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846741007] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:14:00,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:14:00,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 05:14:00,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570666911] [2024-10-13 05:14:00,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:14:00,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 05:14:00,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:14:00,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 05:14:00,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:14:00,527 INFO L87 Difference]: Start difference. First operand 31 states and 44 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-13 05:14:00,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:14:00,745 INFO L93 Difference]: Finished difference Result 101 states and 143 transitions. [2024-10-13 05:14:00,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 05:14:00,746 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 54 [2024-10-13 05:14:00,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:14:00,749 INFO L225 Difference]: With dead ends: 101 [2024-10-13 05:14:00,749 INFO L226 Difference]: Without dead ends: 71 [2024-10-13 05:14:00,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 05:14:00,752 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 66 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:14:00,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 186 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:14:00,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-13 05:14:00,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 59. [2024-10-13 05:14:00,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 40 states have (on average 1.325) internal successors, (53), 40 states have internal predecessors, (53), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 05:14:00,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 85 transitions. [2024-10-13 05:14:00,787 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 85 transitions. Word has length 54 [2024-10-13 05:14:00,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:14:00,788 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 85 transitions. [2024-10-13 05:14:00,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-13 05:14:00,789 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 85 transitions. [2024-10-13 05:14:00,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-13 05:14:00,791 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:14:00,792 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:14:00,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 05:14:00,793 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:14:00,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:14:00,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1118392093, now seen corresponding path program 1 times [2024-10-13 05:14:00,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:14:00,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606754771] [2024-10-13 05:14:00,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:14:00,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:14:00,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:02,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:14:02,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:02,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:14:02,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:02,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:14:02,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:02,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:14:02,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:02,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:14:02,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:02,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:14:02,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:02,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:14:02,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:02,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:14:02,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:02,929 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-13 05:14:02,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:14:02,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606754771] [2024-10-13 05:14:02,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606754771] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:14:02,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:14:02,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 05:14:02,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016912434] [2024-10-13 05:14:02,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:14:02,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 05:14:02,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:14:02,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 05:14:02,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-13 05:14:02,936 INFO L87 Difference]: Start difference. First operand 59 states and 85 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-13 05:14:03,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:14:03,449 INFO L93 Difference]: Finished difference Result 89 states and 123 transitions. [2024-10-13 05:14:03,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 05:14:03,450 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 54 [2024-10-13 05:14:03,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:14:03,451 INFO L225 Difference]: With dead ends: 89 [2024-10-13 05:14:03,451 INFO L226 Difference]: Without dead ends: 87 [2024-10-13 05:14:03,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-13 05:14:03,452 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 58 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 05:14:03,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 127 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 05:14:03,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-13 05:14:03,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 65. [2024-10-13 05:14:03,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 05:14:03,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 93 transitions. [2024-10-13 05:14:03,478 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 93 transitions. Word has length 54 [2024-10-13 05:14:03,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:14:03,480 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 93 transitions. [2024-10-13 05:14:03,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-13 05:14:03,480 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 93 transitions. [2024-10-13 05:14:03,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-13 05:14:03,484 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:14:03,484 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:14:03,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 05:14:03,484 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:14:03,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:14:03,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1642918390, now seen corresponding path program 1 times [2024-10-13 05:14:03,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:14:03,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657760072] [2024-10-13 05:14:03,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:14:03,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:14:03,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:04,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:14:04,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:04,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:14:04,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:04,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:14:04,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:04,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:14:04,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:04,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:14:04,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:04,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:14:04,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:04,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:14:04,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:04,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:14:04,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:04,278 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-13 05:14:04,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:14:04,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657760072] [2024-10-13 05:14:04,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657760072] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:14:04,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:14:04,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 05:14:04,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321622462] [2024-10-13 05:14:04,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:14:04,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 05:14:04,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:14:04,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 05:14:04,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-13 05:14:04,282 INFO L87 Difference]: Start difference. First operand 65 states and 93 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-13 05:14:04,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:14:04,648 INFO L93 Difference]: Finished difference Result 199 states and 277 transitions. [2024-10-13 05:14:04,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 05:14:04,648 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 55 [2024-10-13 05:14:04,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:14:04,651 INFO L225 Difference]: With dead ends: 199 [2024-10-13 05:14:04,651 INFO L226 Difference]: Without dead ends: 163 [2024-10-13 05:14:04,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2024-10-13 05:14:04,652 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 104 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 05:14:04,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 181 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 05:14:04,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-13 05:14:04,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 126. [2024-10-13 05:14:04,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 89 states have (on average 1.303370786516854) internal successors, (116), 89 states have internal predecessors, (116), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 05:14:04,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 180 transitions. [2024-10-13 05:14:04,693 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 180 transitions. Word has length 55 [2024-10-13 05:14:04,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:14:04,694 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 180 transitions. [2024-10-13 05:14:04,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-13 05:14:04,695 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 180 transitions. [2024-10-13 05:14:04,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-13 05:14:04,696 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:14:04,697 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:14:04,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 05:14:04,697 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:14:04,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:14:04,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1700176692, now seen corresponding path program 1 times [2024-10-13 05:14:04,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:14:04,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324584170] [2024-10-13 05:14:04,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:14:04,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:14:04,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:04,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:14:04,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:04,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:14:04,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:04,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:14:04,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:04,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:14:04,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:04,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:14:04,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:04,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:14:04,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:04,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:14:04,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:04,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:14:04,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:04,768 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-13 05:14:04,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:14:04,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324584170] [2024-10-13 05:14:04,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324584170] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:14:04,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:14:04,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 05:14:04,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533415763] [2024-10-13 05:14:04,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:14:04,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 05:14:04,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:14:04,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 05:14:04,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:14:04,770 INFO L87 Difference]: Start difference. First operand 126 states and 180 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-13 05:14:04,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:14:04,818 INFO L93 Difference]: Finished difference Result 275 states and 388 transitions. [2024-10-13 05:14:04,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 05:14:04,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 55 [2024-10-13 05:14:04,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:14:04,822 INFO L225 Difference]: With dead ends: 275 [2024-10-13 05:14:04,823 INFO L226 Difference]: Without dead ends: 150 [2024-10-13 05:14:04,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:14:04,826 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 27 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:14:04,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 95 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:14:04,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-13 05:14:04,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 143. [2024-10-13 05:14:04,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 98 states have (on average 1.2551020408163265) internal successors, (123), 99 states have internal predecessors, (123), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-13 05:14:04,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 199 transitions. [2024-10-13 05:14:04,850 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 199 transitions. Word has length 55 [2024-10-13 05:14:04,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:14:04,851 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 199 transitions. [2024-10-13 05:14:04,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-13 05:14:04,851 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 199 transitions. [2024-10-13 05:14:04,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-13 05:14:04,852 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:14:04,852 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:14:04,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 05:14:04,853 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:14:04,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:14:04,853 INFO L85 PathProgramCache]: Analyzing trace with hash 962860020, now seen corresponding path program 1 times [2024-10-13 05:14:04,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:14:04,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905643093] [2024-10-13 05:14:04,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:14:04,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:14:04,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:11,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:14:11,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:11,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:14:11,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:11,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:14:11,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:11,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:14:11,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:11,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:14:11,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:11,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:14:11,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:11,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:14:11,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:11,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:14:11,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:11,839 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-13 05:14:11,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:14:11,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905643093] [2024-10-13 05:14:11,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905643093] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:14:11,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:14:11,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 05:14:11,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700209835] [2024-10-13 05:14:11,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:14:11,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 05:14:11,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:14:11,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 05:14:11,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:14:11,844 INFO L87 Difference]: Start difference. First operand 143 states and 199 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-13 05:14:15,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-13 05:14:16,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:14:16,123 INFO L93 Difference]: Finished difference Result 226 states and 310 transitions. [2024-10-13 05:14:16,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 05:14:16,124 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 55 [2024-10-13 05:14:16,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:14:16,127 INFO L225 Difference]: With dead ends: 226 [2024-10-13 05:14:16,127 INFO L226 Difference]: Without dead ends: 172 [2024-10-13 05:14:16,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 05:14:16,129 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 35 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-13 05:14:16,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 115 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-10-13 05:14:16,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-10-13 05:14:16,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 145. [2024-10-13 05:14:16,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 100 states have (on average 1.25) internal successors, (125), 101 states have internal predecessors, (125), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-13 05:14:16,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 201 transitions. [2024-10-13 05:14:16,149 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 201 transitions. Word has length 55 [2024-10-13 05:14:16,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:14:16,150 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 201 transitions. [2024-10-13 05:14:16,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-13 05:14:16,150 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 201 transitions. [2024-10-13 05:14:16,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-13 05:14:16,151 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:14:16,151 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:14:16,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 05:14:16,152 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:14:16,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:14:16,152 INFO L85 PathProgramCache]: Analyzing trace with hash -324168414, now seen corresponding path program 1 times [2024-10-13 05:14:16,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:14:16,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314761318] [2024-10-13 05:14:16,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:14:16,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:14:16,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:16,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:14:16,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:16,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:14:16,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:16,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:14:16,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:16,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:14:16,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:16,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:14:16,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:16,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:14:16,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:16,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:14:16,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:16,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:14:16,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:16,403 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-13 05:14:16,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:14:16,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314761318] [2024-10-13 05:14:16,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314761318] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:14:16,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:14:16,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 05:14:16,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674152224] [2024-10-13 05:14:16,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:14:16,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 05:14:16,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:14:16,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 05:14:16,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:14:16,406 INFO L87 Difference]: Start difference. First operand 145 states and 201 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-13 05:14:16,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:14:16,607 INFO L93 Difference]: Finished difference Result 254 states and 347 transitions. [2024-10-13 05:14:16,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 05:14:16,608 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 55 [2024-10-13 05:14:16,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:14:16,610 INFO L225 Difference]: With dead ends: 254 [2024-10-13 05:14:16,612 INFO L226 Difference]: Without dead ends: 165 [2024-10-13 05:14:16,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-10-13 05:14:16,614 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 52 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:14:16,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 175 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:14:16,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-10-13 05:14:16,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 151. [2024-10-13 05:14:16,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 106 states have (on average 1.2358490566037736) internal successors, (131), 107 states have internal predecessors, (131), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-13 05:14:16,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 207 transitions. [2024-10-13 05:14:16,649 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 207 transitions. Word has length 55 [2024-10-13 05:14:16,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:14:16,650 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 207 transitions. [2024-10-13 05:14:16,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-13 05:14:16,650 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 207 transitions. [2024-10-13 05:14:16,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-13 05:14:16,654 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:14:16,655 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:14:16,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 05:14:16,655 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:14:16,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:14:16,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1459036371, now seen corresponding path program 1 times [2024-10-13 05:14:16,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:14:16,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252614884] [2024-10-13 05:14:16,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:14:16,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:14:16,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:16,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:14:16,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:16,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:14:16,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:16,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:14:16,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:16,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:14:16,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:16,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:14:16,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:16,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:14:16,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:16,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:14:16,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:16,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:14:16,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:16,828 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-13 05:14:16,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:14:16,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252614884] [2024-10-13 05:14:16,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252614884] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:14:16,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:14:16,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 05:14:16,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884950195] [2024-10-13 05:14:16,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:14:16,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:14:16,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:14:16,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:14:16,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:14:16,832 INFO L87 Difference]: Start difference. First operand 151 states and 207 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-13 05:14:16,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:14:16,928 INFO L93 Difference]: Finished difference Result 254 states and 345 transitions. [2024-10-13 05:14:16,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 05:14:16,931 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 56 [2024-10-13 05:14:16,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:14:16,933 INFO L225 Difference]: With dead ends: 254 [2024-10-13 05:14:16,933 INFO L226 Difference]: Without dead ends: 165 [2024-10-13 05:14:16,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 05:14:16,934 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 42 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:14:16,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 135 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:14:16,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-10-13 05:14:16,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 153. [2024-10-13 05:14:16,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 108 states have (on average 1.2314814814814814) internal successors, (133), 109 states have internal predecessors, (133), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-13 05:14:16,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 209 transitions. [2024-10-13 05:14:16,953 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 209 transitions. Word has length 56 [2024-10-13 05:14:16,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:14:16,954 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 209 transitions. [2024-10-13 05:14:16,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-13 05:14:16,954 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 209 transitions. [2024-10-13 05:14:16,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-13 05:14:16,955 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:14:16,955 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:14:16,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 05:14:16,955 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:14:16,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:14:16,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1458976789, now seen corresponding path program 1 times [2024-10-13 05:14:16,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:14:16,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696951781] [2024-10-13 05:14:16,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:14:16,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:14:16,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:18,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:14:18,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:18,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:14:18,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:18,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:14:18,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:18,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:14:18,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:18,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:14:18,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:18,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:14:18,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:18,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:14:18,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:18,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:14:18,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:18,995 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-13 05:14:18,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:14:18,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696951781] [2024-10-13 05:14:18,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696951781] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:14:18,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:14:18,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 05:14:18,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740683442] [2024-10-13 05:14:18,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:14:18,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 05:14:18,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:14:18,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 05:14:18,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-10-13 05:14:18,999 INFO L87 Difference]: Start difference. First operand 153 states and 209 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-13 05:14:19,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:14:19,665 INFO L93 Difference]: Finished difference Result 182 states and 239 transitions. [2024-10-13 05:14:19,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 05:14:19,666 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 56 [2024-10-13 05:14:19,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:14:19,668 INFO L225 Difference]: With dead ends: 182 [2024-10-13 05:14:19,668 INFO L226 Difference]: Without dead ends: 180 [2024-10-13 05:14:19,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2024-10-13 05:14:19,669 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 67 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 05:14:19,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 202 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 05:14:19,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-10-13 05:14:19,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 160. [2024-10-13 05:14:19,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 115 states have (on average 1.2260869565217392) internal successors, (141), 116 states have internal predecessors, (141), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-13 05:14:19,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 217 transitions. [2024-10-13 05:14:19,696 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 217 transitions. Word has length 56 [2024-10-13 05:14:19,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:14:19,696 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 217 transitions. [2024-10-13 05:14:19,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-13 05:14:19,697 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 217 transitions. [2024-10-13 05:14:19,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-13 05:14:19,698 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:14:19,698 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:14:19,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 05:14:19,698 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:14:19,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:14:19,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1356229116, now seen corresponding path program 1 times [2024-10-13 05:14:19,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:14:19,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518904706] [2024-10-13 05:14:19,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:14:19,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:14:19,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:21,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:14:21,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:21,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:14:21,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:21,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:14:21,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:21,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:14:21,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:21,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:14:21,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:21,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:14:21,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:21,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:14:21,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:21,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:14:21,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:21,293 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-13 05:14:21,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:14:21,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518904706] [2024-10-13 05:14:21,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518904706] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:14:21,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:14:21,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-13 05:14:21,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50192420] [2024-10-13 05:14:21,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:14:21,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 05:14:21,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:14:21,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 05:14:21,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-10-13 05:14:21,296 INFO L87 Difference]: Start difference. First operand 160 states and 217 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-13 05:14:22,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:14:22,019 INFO L93 Difference]: Finished difference Result 206 states and 275 transitions. [2024-10-13 05:14:22,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 05:14:22,020 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 57 [2024-10-13 05:14:22,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:14:22,021 INFO L225 Difference]: With dead ends: 206 [2024-10-13 05:14:22,021 INFO L226 Difference]: Without dead ends: 204 [2024-10-13 05:14:22,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2024-10-13 05:14:22,022 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 98 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 05:14:22,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 198 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 05:14:22,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-10-13 05:14:22,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 192. [2024-10-13 05:14:22,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 138 states have (on average 1.2246376811594204) internal successors, (169), 139 states have internal predecessors, (169), 46 states have call successors, (46), 7 states have call predecessors, (46), 7 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-13 05:14:22,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 261 transitions. [2024-10-13 05:14:22,046 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 261 transitions. Word has length 57 [2024-10-13 05:14:22,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:14:22,047 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 261 transitions. [2024-10-13 05:14:22,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-13 05:14:22,047 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 261 transitions. [2024-10-13 05:14:22,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-13 05:14:22,051 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:14:22,051 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:14:22,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 05:14:22,052 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:14:22,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:14:22,052 INFO L85 PathProgramCache]: Analyzing trace with hash 244190447, now seen corresponding path program 1 times [2024-10-13 05:14:22,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:14:22,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424903342] [2024-10-13 05:14:22,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:14:22,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:14:22,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:24,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:14:24,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:24,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:14:24,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:24,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:14:24,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:24,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:14:24,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:24,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:14:24,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:24,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:14:24,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:24,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:14:24,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:24,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:14:24,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:24,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-13 05:14:24,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:24,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-13 05:14:24,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:24,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-13 05:14:24,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:24,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 05:14:24,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:24,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 05:14:24,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:24,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 05:14:24,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:24,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-13 05:14:24,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:24,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 05:14:24,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:24,365 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 481 trivial. 0 not checked. [2024-10-13 05:14:24,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:14:24,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424903342] [2024-10-13 05:14:24,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424903342] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 05:14:24,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283667307] [2024-10-13 05:14:24,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:14:24,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 05:14:24,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:14:24,368 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 05:14:24,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 05:14:24,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:14:24,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-13 05:14:24,485 INFO L278 TraceCheckSpWp]: Computing forward predicates...