./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_variablewrapping_wrapper-sp_file-15.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_variablewrapping_wrapper-sp_file-15.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 f0b29745d0295a6ea87696d7526ff1489507abd106a770729eb8df39c35a2d6d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 06:35:42,281 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 06:35:42,374 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 06:35:42,380 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 06:35:42,381 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 06:35:42,416 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 06:35:42,417 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 06:35:42,417 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 06:35:42,418 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 06:35:42,420 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 06:35:42,421 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 06:35:42,421 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 06:35:42,422 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 06:35:42,422 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 06:35:42,424 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 06:35:42,425 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 06:35:42,425 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 06:35:42,425 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 06:35:42,426 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 06:35:42,426 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 06:35:42,426 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 06:35:42,429 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 06:35:42,429 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 06:35:42,429 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 06:35:42,430 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 06:35:42,430 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 06:35:42,430 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 06:35:42,431 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 06:35:42,431 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 06:35:42,431 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 06:35:42,432 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 06:35:42,432 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 06:35:42,432 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:35:42,433 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 06:35:42,433 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 06:35:42,433 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 06:35:42,433 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 06:35:42,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 06:35:42,434 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 06:35:42,434 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 06:35:42,434 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 06:35:42,435 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 06:35:42,435 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 -> f0b29745d0295a6ea87696d7526ff1489507abd106a770729eb8df39c35a2d6d [2024-10-13 06:35:42,730 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 06:35:42,759 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 06:35:42,764 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 06:35:42,766 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 06:35:42,766 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 06:35:42,767 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-15.i [2024-10-13 06:35:44,305 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 06:35:44,574 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 06:35:44,575 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-15.i [2024-10-13 06:35:44,590 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56256e9bd/f87202f5141e4687a8a08bcae6926a61/FLAGafc051d05 [2024-10-13 06:35:44,608 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56256e9bd/f87202f5141e4687a8a08bcae6926a61 [2024-10-13 06:35:44,611 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 06:35:44,614 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 06:35:44,617 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 06:35:44,619 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 06:35:44,624 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 06:35:44,625 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:35:44" (1/1) ... [2024-10-13 06:35:44,626 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40530a05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:35:44, skipping insertion in model container [2024-10-13 06:35:44,627 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:35:44" (1/1) ... [2024-10-13 06:35:44,662 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 06:35:44,856 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_variablewrapping_wrapper-sp_file-15.i[917,930] [2024-10-13 06:35:44,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:35:44,927 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 06:35:44,939 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_variablewrapping_wrapper-sp_file-15.i[917,930] [2024-10-13 06:35:44,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:35:45,008 INFO L204 MainTranslator]: Completed translation [2024-10-13 06:35:45,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:35:45 WrapperNode [2024-10-13 06:35:45,009 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 06:35:45,010 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 06:35:45,012 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 06:35:45,012 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 06:35:45,020 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:35:45" (1/1) ... [2024-10-13 06:35:45,041 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:35:45" (1/1) ... [2024-10-13 06:35:45,085 INFO L138 Inliner]: procedures = 29, calls = 151, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 505 [2024-10-13 06:35:45,086 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 06:35:45,087 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 06:35:45,087 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 06:35:45,087 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 06:35:45,099 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:35:45" (1/1) ... [2024-10-13 06:35:45,100 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:35:45" (1/1) ... [2024-10-13 06:35:45,109 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:35:45" (1/1) ... [2024-10-13 06:35:45,140 INFO L175 MemorySlicer]: Split 127 memory accesses to 2 slices as follows [2, 125]. 98 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 12]. The 16 writes are split as follows [0, 16]. [2024-10-13 06:35:45,140 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:35:45" (1/1) ... [2024-10-13 06:35:45,141 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:35:45" (1/1) ... [2024-10-13 06:35:45,154 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:35:45" (1/1) ... [2024-10-13 06:35:45,160 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:35:45" (1/1) ... [2024-10-13 06:35:45,162 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:35:45" (1/1) ... [2024-10-13 06:35:45,165 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:35:45" (1/1) ... [2024-10-13 06:35:45,170 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 06:35:45,171 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 06:35:45,172 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 06:35:45,172 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 06:35:45,173 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:35:45" (1/1) ... [2024-10-13 06:35:45,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:35:45,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:35:45,221 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 06:35:45,229 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 06:35:45,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 06:35:45,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-13 06:35:45,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-13 06:35:45,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 06:35:45,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 06:35:45,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-13 06:35:45,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-13 06:35:45,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 06:35:45,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 06:35:45,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-13 06:35:45,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-13 06:35:45,311 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 06:35:45,311 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 06:35:45,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 06:35:45,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 06:35:45,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 06:35:45,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 06:35:45,481 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 06:35:45,484 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 06:35:46,014 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-10-13 06:35:46,014 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 06:35:46,058 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 06:35:46,059 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 06:35:46,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:35:46 BoogieIcfgContainer [2024-10-13 06:35:46,060 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 06:35:46,062 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 06:35:46,063 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 06:35:46,069 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 06:35:46,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:35:44" (1/3) ... [2024-10-13 06:35:46,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2844cd49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:35:46, skipping insertion in model container [2024-10-13 06:35:46,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:35:45" (2/3) ... [2024-10-13 06:35:46,071 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2844cd49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:35:46, skipping insertion in model container [2024-10-13 06:35:46,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:35:46" (3/3) ... [2024-10-13 06:35:46,075 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-15.i [2024-10-13 06:35:46,091 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 06:35:46,091 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 06:35:46,160 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:35:46,166 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;@14ee2b5e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:35:46,167 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 06:35:46,172 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 91 states have (on average 1.4835164835164836) internal successors, (135), 92 states have internal predecessors, (135), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 06:35:46,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-13 06:35:46,186 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:35:46,187 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:35:46,188 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:35:46,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:35:46,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1552049095, now seen corresponding path program 1 times [2024-10-13 06:35:46,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:35:46,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270330130] [2024-10-13 06:35:46,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:35:46,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:35:46,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:46,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:35:46,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:46,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:35:46,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:46,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:35:46,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:46,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:35:46,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:46,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:35:46,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:46,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:35:46,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:46,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:35:46,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:46,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:35:46,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:46,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:35:46,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:46,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:35:46,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:46,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:35:46,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:46,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:35:46,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:46,698 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:35:46,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:35:46,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270330130] [2024-10-13 06:35:46,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270330130] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:35:46,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:35:46,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 06:35:46,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982588796] [2024-10-13 06:35:46,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:35:46,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 06:35:46,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:35:46,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 06:35:46,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:35:46,743 INFO L87 Difference]: Start difference. First operand has 106 states, 91 states have (on average 1.4835164835164836) internal successors, (135), 92 states have internal predecessors, (135), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 06:35:46,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:35:46,798 INFO L93 Difference]: Finished difference Result 209 states and 328 transitions. [2024-10-13 06:35:46,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 06:35:46,803 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2024-10-13 06:35:46,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:35:46,813 INFO L225 Difference]: With dead ends: 209 [2024-10-13 06:35:46,814 INFO L226 Difference]: Without dead ends: 104 [2024-10-13 06:35:46,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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 06:35:46,824 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:35:46,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:35:46,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-13 06:35:46,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-10-13 06:35:46,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 90 states have (on average 1.4222222222222223) internal successors, (128), 90 states have internal predecessors, (128), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 06:35:46,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 152 transitions. [2024-10-13 06:35:46,886 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 152 transitions. Word has length 110 [2024-10-13 06:35:46,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:35:46,887 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 152 transitions. [2024-10-13 06:35:46,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 06:35:46,888 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 152 transitions. [2024-10-13 06:35:46,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-13 06:35:46,893 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:35:46,893 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:35:46,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 06:35:46,894 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:35:46,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:35:46,894 INFO L85 PathProgramCache]: Analyzing trace with hash 111661611, now seen corresponding path program 1 times [2024-10-13 06:35:46,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:35:46,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228522510] [2024-10-13 06:35:46,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:35:46,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:35:47,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:47,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:35:47,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:47,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:35:47,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:47,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:35:47,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:47,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:35:47,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:47,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:35:47,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:47,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:35:47,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:47,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:35:47,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:47,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:35:47,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:47,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:35:47,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:47,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:35:47,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:47,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:35:47,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:47,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:35:47,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:47,200 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:35:47,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:35:47,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228522510] [2024-10-13 06:35:47,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228522510] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:35:47,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:35:47,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 06:35:47,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829331513] [2024-10-13 06:35:47,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:35:47,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 06:35:47,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:35:47,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 06:35:47,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:35:47,205 INFO L87 Difference]: Start difference. First operand 104 states and 152 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:35:47,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:35:47,251 INFO L93 Difference]: Finished difference Result 208 states and 305 transitions. [2024-10-13 06:35:47,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 06:35:47,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2024-10-13 06:35:47,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:35:47,254 INFO L225 Difference]: With dead ends: 208 [2024-10-13 06:35:47,254 INFO L226 Difference]: Without dead ends: 105 [2024-10-13 06:35:47,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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 06:35:47,257 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:35:47,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 289 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:35:47,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-13 06:35:47,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-10-13 06:35:47,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 91 states have internal predecessors, (129), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 06:35:47,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 153 transitions. [2024-10-13 06:35:47,278 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 153 transitions. Word has length 110 [2024-10-13 06:35:47,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:35:47,280 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 153 transitions. [2024-10-13 06:35:47,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:35:47,281 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 153 transitions. [2024-10-13 06:35:47,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-13 06:35:47,286 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:35:47,286 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:35:47,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 06:35:47,287 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:35:47,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:35:47,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1882483095, now seen corresponding path program 1 times [2024-10-13 06:35:47,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:35:47,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527319181] [2024-10-13 06:35:47,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:35:47,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:35:47,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:47,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:35:47,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:47,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:35:47,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:47,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:35:47,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:47,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:35:47,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:47,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:35:47,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:47,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:35:47,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:47,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:35:47,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:47,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:35:47,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:47,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:35:47,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:47,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:35:47,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:47,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:35:47,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:47,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:35:47,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:47,609 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:35:47,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:35:47,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527319181] [2024-10-13 06:35:47,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527319181] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:35:47,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:35:47,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 06:35:47,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288898304] [2024-10-13 06:35:47,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:35:47,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 06:35:47,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:35:47,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 06:35:47,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:35:47,617 INFO L87 Difference]: Start difference. First operand 105 states and 153 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:35:47,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:35:47,659 INFO L93 Difference]: Finished difference Result 210 states and 307 transitions. [2024-10-13 06:35:47,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 06:35:47,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2024-10-13 06:35:47,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:35:47,662 INFO L225 Difference]: With dead ends: 210 [2024-10-13 06:35:47,662 INFO L226 Difference]: Without dead ends: 106 [2024-10-13 06:35:47,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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 06:35:47,664 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:35:47,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 290 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:35:47,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-13 06:35:47,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-10-13 06:35:47,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 92 states have (on average 1.4130434782608696) internal successors, (130), 92 states have internal predecessors, (130), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 06:35:47,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 154 transitions. [2024-10-13 06:35:47,674 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 154 transitions. Word has length 110 [2024-10-13 06:35:47,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:35:47,679 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 154 transitions. [2024-10-13 06:35:47,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:35:47,679 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 154 transitions. [2024-10-13 06:35:47,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-13 06:35:47,683 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:35:47,683 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:35:47,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 06:35:47,684 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:35:47,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:35:47,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1181418517, now seen corresponding path program 1 times [2024-10-13 06:35:47,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:35:47,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900856781] [2024-10-13 06:35:47,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:35:47,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:35:47,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:48,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:35:48,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:48,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:35:48,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:48,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:35:48,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:48,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:35:48,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:48,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:35:48,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:48,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:35:48,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:48,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:35:48,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:48,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:35:48,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:48,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:35:48,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:48,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:35:48,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:48,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:35:48,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:48,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:35:48,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:48,899 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:35:48,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:35:48,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900856781] [2024-10-13 06:35:48,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900856781] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:35:48,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:35:48,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 06:35:48,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313880761] [2024-10-13 06:35:48,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:35:48,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 06:35:48,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:35:48,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 06:35:48,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:35:48,906 INFO L87 Difference]: Start difference. First operand 106 states and 154 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 06:35:49,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:35:49,442 INFO L93 Difference]: Finished difference Result 255 states and 369 transitions. [2024-10-13 06:35:49,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:35:49,443 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2024-10-13 06:35:49,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:35:49,445 INFO L225 Difference]: With dead ends: 255 [2024-10-13 06:35:49,445 INFO L226 Difference]: Without dead ends: 150 [2024-10-13 06:35:49,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:35:49,448 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 324 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 06:35:49,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 464 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 06:35:49,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-13 06:35:49,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 117. [2024-10-13 06:35:49,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 103 states have (on average 1.4174757281553398) internal successors, (146), 103 states have internal predecessors, (146), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 06:35:49,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 170 transitions. [2024-10-13 06:35:49,497 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 170 transitions. Word has length 110 [2024-10-13 06:35:49,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:35:49,498 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 170 transitions. [2024-10-13 06:35:49,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 06:35:49,498 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 170 transitions. [2024-10-13 06:35:49,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-13 06:35:49,504 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:35:49,504 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:35:49,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 06:35:49,505 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:35:49,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:35:49,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1889022113, now seen corresponding path program 1 times [2024-10-13 06:35:49,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:35:49,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677562638] [2024-10-13 06:35:49,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:35:49,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:35:49,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:49,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:35:49,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:49,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:35:49,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:49,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:35:49,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:49,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:35:49,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:49,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:35:49,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:49,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:35:49,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:49,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:35:49,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:49,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:35:49,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:49,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:35:49,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:49,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:35:49,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:49,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:35:49,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:49,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:35:49,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:49,848 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:35:49,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:35:49,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677562638] [2024-10-13 06:35:49,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677562638] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:35:49,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:35:49,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:35:49,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532618473] [2024-10-13 06:35:49,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:35:49,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:35:49,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:35:49,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:35:49,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:35:49,851 INFO L87 Difference]: Start difference. First operand 117 states and 170 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:35:49,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:35:49,997 INFO L93 Difference]: Finished difference Result 244 states and 357 transitions. [2024-10-13 06:35:49,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:35:49,999 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2024-10-13 06:35:49,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:35:50,002 INFO L225 Difference]: With dead ends: 244 [2024-10-13 06:35:50,002 INFO L226 Difference]: Without dead ends: 128 [2024-10-13 06:35:50,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:35:50,007 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 12 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:35:50,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 490 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:35:50,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-13 06:35:50,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 119. [2024-10-13 06:35:50,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 105 states have (on average 1.4095238095238096) internal successors, (148), 105 states have internal predecessors, (148), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 06:35:50,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 172 transitions. [2024-10-13 06:35:50,033 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 172 transitions. Word has length 111 [2024-10-13 06:35:50,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:35:50,033 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 172 transitions. [2024-10-13 06:35:50,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:35:50,034 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 172 transitions. [2024-10-13 06:35:50,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-13 06:35:50,035 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:35:50,035 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:35:50,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 06:35:50,036 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:35:50,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:35:50,039 INFO L85 PathProgramCache]: Analyzing trace with hash 717001441, now seen corresponding path program 1 times [2024-10-13 06:35:50,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:35:50,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685681902] [2024-10-13 06:35:50,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:35:50,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:35:50,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:50,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:35:50,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:50,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:35:50,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:50,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:35:50,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:50,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:35:50,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:50,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:35:50,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:50,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:35:50,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:50,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:35:50,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:50,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:35:50,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:50,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:35:50,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:50,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:35:50,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:50,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:35:50,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:50,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:35:51,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:51,006 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:35:51,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:35:51,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685681902] [2024-10-13 06:35:51,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685681902] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:35:51,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:35:51,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 06:35:51,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484236379] [2024-10-13 06:35:51,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:35:51,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 06:35:51,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:35:51,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 06:35:51,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:35:51,010 INFO L87 Difference]: Start difference. First operand 119 states and 172 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:35:51,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:35:51,456 INFO L93 Difference]: Finished difference Result 297 states and 430 transitions. [2024-10-13 06:35:51,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 06:35:51,457 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2024-10-13 06:35:51,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:35:51,459 INFO L225 Difference]: With dead ends: 297 [2024-10-13 06:35:51,459 INFO L226 Difference]: Without dead ends: 179 [2024-10-13 06:35:51,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:35:51,461 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 242 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 06:35:51,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 706 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 06:35:51,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-10-13 06:35:51,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 129. [2024-10-13 06:35:51,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 115 states have (on average 1.4260869565217391) internal successors, (164), 115 states have internal predecessors, (164), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 06:35:51,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 188 transitions. [2024-10-13 06:35:51,484 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 188 transitions. Word has length 111 [2024-10-13 06:35:51,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:35:51,485 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 188 transitions. [2024-10-13 06:35:51,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:35:51,486 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 188 transitions. [2024-10-13 06:35:51,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-13 06:35:51,487 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:35:51,487 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:35:51,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 06:35:51,488 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:35:51,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:35:51,488 INFO L85 PathProgramCache]: Analyzing trace with hash -360231913, now seen corresponding path program 1 times [2024-10-13 06:35:51,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:35:51,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943759245] [2024-10-13 06:35:51,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:35:51,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:35:51,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:52,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:35:52,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:52,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:35:52,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:52,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:35:52,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:52,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:35:52,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:52,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:35:52,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:52,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:35:52,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:52,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:35:52,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:52,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:35:52,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:52,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:35:52,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:52,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:35:52,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:52,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:35:52,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:52,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:35:52,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:52,296 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:35:52,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:35:52,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943759245] [2024-10-13 06:35:52,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943759245] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:35:52,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:35:52,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:35:52,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861910276] [2024-10-13 06:35:52,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:35:52,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:35:52,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:35:52,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:35:52,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:35:52,299 INFO L87 Difference]: Start difference. First operand 129 states and 188 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:35:52,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:35:52,588 INFO L93 Difference]: Finished difference Result 312 states and 454 transitions. [2024-10-13 06:35:52,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:35:52,589 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 112 [2024-10-13 06:35:52,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:35:52,590 INFO L225 Difference]: With dead ends: 312 [2024-10-13 06:35:52,591 INFO L226 Difference]: Without dead ends: 184 [2024-10-13 06:35:52,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:35:52,592 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 217 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:35:52,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 375 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:35:52,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-10-13 06:35:52,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 148. [2024-10-13 06:35:52,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 134 states have (on average 1.4328358208955223) internal successors, (192), 134 states have internal predecessors, (192), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 06:35:52,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 216 transitions. [2024-10-13 06:35:52,615 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 216 transitions. Word has length 112 [2024-10-13 06:35:52,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:35:52,616 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 216 transitions. [2024-10-13 06:35:52,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:35:52,616 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 216 transitions. [2024-10-13 06:35:52,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-13 06:35:52,619 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:35:52,619 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:35:52,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 06:35:52,619 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:35:52,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:35:52,620 INFO L85 PathProgramCache]: Analyzing trace with hash -947037927, now seen corresponding path program 1 times [2024-10-13 06:35:52,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:35:52,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768828595] [2024-10-13 06:35:52,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:35:52,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:35:52,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:53,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:35:53,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:53,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:35:53,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:53,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:35:53,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:53,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:35:53,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:53,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:35:53,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:53,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:35:53,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:53,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:35:53,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:53,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:35:53,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:53,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:35:53,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:53,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:35:53,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:53,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:35:53,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:53,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:35:53,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:53,335 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:35:53,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:35:53,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768828595] [2024-10-13 06:35:53,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768828595] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:35:53,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:35:53,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:35:53,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025839700] [2024-10-13 06:35:53,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:35:53,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:35:53,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:35:53,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:35:53,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:35:53,337 INFO L87 Difference]: Start difference. First operand 148 states and 216 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:35:53,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:35:53,700 INFO L93 Difference]: Finished difference Result 339 states and 492 transitions. [2024-10-13 06:35:53,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:35:53,701 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 112 [2024-10-13 06:35:53,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:35:53,702 INFO L225 Difference]: With dead ends: 339 [2024-10-13 06:35:53,702 INFO L226 Difference]: Without dead ends: 192 [2024-10-13 06:35:53,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:35:53,703 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 159 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:35:53,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 507 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:35:53,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-10-13 06:35:53,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 157. [2024-10-13 06:35:53,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 143 states have (on average 1.4335664335664335) internal successors, (205), 143 states have internal predecessors, (205), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 06:35:53,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 229 transitions. [2024-10-13 06:35:53,723 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 229 transitions. Word has length 112 [2024-10-13 06:35:53,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:35:53,724 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 229 transitions. [2024-10-13 06:35:53,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:35:53,725 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 229 transitions. [2024-10-13 06:35:53,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-13 06:35:53,727 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:35:53,727 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:35:53,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 06:35:53,728 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:35:53,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:35:53,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1926559089, now seen corresponding path program 1 times [2024-10-13 06:35:53,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:35:53,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537694681] [2024-10-13 06:35:53,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:35:53,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:35:53,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:54,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:35:54,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:54,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:35:54,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:54,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:35:54,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:54,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:35:54,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:54,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:35:54,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:54,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:35:54,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:54,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:35:54,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:54,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:35:54,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:54,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:35:54,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:54,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:35:54,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:54,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:35:54,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:54,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:35:54,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:54,155 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:35:54,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:35:54,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537694681] [2024-10-13 06:35:54,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537694681] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:35:54,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:35:54,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 06:35:54,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581738872] [2024-10-13 06:35:54,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:35:54,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 06:35:54,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:35:54,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 06:35:54,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:35:54,159 INFO L87 Difference]: Start difference. First operand 157 states and 229 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:35:54,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:35:54,479 INFO L93 Difference]: Finished difference Result 374 states and 543 transitions. [2024-10-13 06:35:54,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:35:54,480 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2024-10-13 06:35:54,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:35:54,481 INFO L225 Difference]: With dead ends: 374 [2024-10-13 06:35:54,482 INFO L226 Difference]: Without dead ends: 218 [2024-10-13 06:35:54,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:35:54,483 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 160 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:35:54,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 695 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:35:54,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-10-13 06:35:54,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 185. [2024-10-13 06:35:54,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 171 states have (on average 1.4385964912280702) internal successors, (246), 171 states have internal predecessors, (246), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 06:35:54,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 270 transitions. [2024-10-13 06:35:54,500 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 270 transitions. Word has length 113 [2024-10-13 06:35:54,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:35:54,500 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 270 transitions. [2024-10-13 06:35:54,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:35:54,500 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 270 transitions. [2024-10-13 06:35:54,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-13 06:35:54,501 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:35:54,502 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:35:54,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 06:35:54,502 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:35:54,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:35:54,502 INFO L85 PathProgramCache]: Analyzing trace with hash 585017882, now seen corresponding path program 1 times [2024-10-13 06:35:54,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:35:54,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360480959] [2024-10-13 06:35:54,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:35:54,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:35:54,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:55,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:35:55,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:55,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:35:55,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:55,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:35:55,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:55,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:35:55,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:55,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:35:55,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:55,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:35:55,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:55,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:35:55,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:55,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:35:55,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:55,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:35:55,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:55,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:35:55,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:55,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:35:55,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:55,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:35:55,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:55,826 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:35:55,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:35:55,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360480959] [2024-10-13 06:35:55,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360480959] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:35:55,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:35:55,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 06:35:55,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340639122] [2024-10-13 06:35:55,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:35:55,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 06:35:55,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:35:55,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 06:35:55,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:35:55,828 INFO L87 Difference]: Start difference. First operand 185 states and 270 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:35:56,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:35:56,206 INFO L93 Difference]: Finished difference Result 498 states and 725 transitions. [2024-10-13 06:35:56,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:35:56,207 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2024-10-13 06:35:56,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:35:56,208 INFO L225 Difference]: With dead ends: 498 [2024-10-13 06:35:56,208 INFO L226 Difference]: Without dead ends: 285 [2024-10-13 06:35:56,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:35:56,209 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 374 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:35:56,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 452 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:35:56,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-10-13 06:35:56,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 211. [2024-10-13 06:35:56,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 197 states have (on average 1.4365482233502538) internal successors, (283), 197 states have internal predecessors, (283), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 06:35:56,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 307 transitions. [2024-10-13 06:35:56,225 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 307 transitions. Word has length 113 [2024-10-13 06:35:56,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:35:56,225 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 307 transitions. [2024-10-13 06:35:56,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:35:56,226 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 307 transitions. [2024-10-13 06:35:56,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-13 06:35:56,227 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:35:56,227 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:35:56,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 06:35:56,227 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:35:56,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:35:56,228 INFO L85 PathProgramCache]: Analyzing trace with hash -648266811, now seen corresponding path program 1 times [2024-10-13 06:35:56,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:35:56,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742244872] [2024-10-13 06:35:56,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:35:56,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:35:56,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:56,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:35:56,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:56,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:35:56,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:56,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:35:56,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:56,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:35:56,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:56,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:35:56,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:56,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:35:56,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:56,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:35:56,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:56,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:35:56,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:56,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:35:56,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:56,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:35:56,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:56,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:35:56,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:56,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:35:56,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:56,881 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:35:56,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:35:56,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742244872] [2024-10-13 06:35:56,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742244872] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:35:56,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:35:56,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 06:35:56,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236999539] [2024-10-13 06:35:56,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:35:56,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 06:35:56,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:35:56,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 06:35:56,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:35:56,884 INFO L87 Difference]: Start difference. First operand 211 states and 307 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:35:57,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:35:57,243 INFO L93 Difference]: Finished difference Result 403 states and 584 transitions. [2024-10-13 06:35:57,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:35:57,246 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2024-10-13 06:35:57,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:35:57,248 INFO L225 Difference]: With dead ends: 403 [2024-10-13 06:35:57,248 INFO L226 Difference]: Without dead ends: 193 [2024-10-13 06:35:57,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:35:57,251 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 130 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:35:57,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 561 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:35:57,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-10-13 06:35:57,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 181. [2024-10-13 06:35:57,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 167 states have (on average 1.407185628742515) internal successors, (235), 167 states have internal predecessors, (235), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 06:35:57,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 259 transitions. [2024-10-13 06:35:57,270 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 259 transitions. Word has length 113 [2024-10-13 06:35:57,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:35:57,270 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 259 transitions. [2024-10-13 06:35:57,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:35:57,271 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 259 transitions. [2024-10-13 06:35:57,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-13 06:35:57,272 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:35:57,272 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:35:57,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 06:35:57,273 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:35:57,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:35:57,273 INFO L85 PathProgramCache]: Analyzing trace with hash -974403396, now seen corresponding path program 1 times [2024-10-13 06:35:57,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:35:57,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750386041] [2024-10-13 06:35:57,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:35:57,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:35:57,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:57,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:35:57,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:57,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:35:57,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:57,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:35:57,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:57,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:35:57,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:57,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:35:57,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:57,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:35:57,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:57,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:35:57,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:57,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:35:57,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:57,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:35:57,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:57,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:35:57,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:57,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:35:57,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:57,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:35:57,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:57,895 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:35:57,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:35:57,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750386041] [2024-10-13 06:35:57,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750386041] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:35:57,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:35:57,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 06:35:57,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802096549] [2024-10-13 06:35:57,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:35:57,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 06:35:57,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:35:57,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 06:35:57,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:35:57,898 INFO L87 Difference]: Start difference. First operand 181 states and 259 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:35:58,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:35:58,198 INFO L93 Difference]: Finished difference Result 367 states and 525 transitions. [2024-10-13 06:35:58,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:35:58,198 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2024-10-13 06:35:58,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:35:58,200 INFO L225 Difference]: With dead ends: 367 [2024-10-13 06:35:58,200 INFO L226 Difference]: Without dead ends: 187 [2024-10-13 06:35:58,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:35:58,201 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 147 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:35:58,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 494 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:35:58,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-10-13 06:35:58,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 180. [2024-10-13 06:35:58,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 166 states have (on average 1.3975903614457832) internal successors, (232), 166 states have internal predecessors, (232), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 06:35:58,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 256 transitions. [2024-10-13 06:35:58,215 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 256 transitions. Word has length 114 [2024-10-13 06:35:58,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:35:58,216 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 256 transitions. [2024-10-13 06:35:58,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:35:58,216 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 256 transitions. [2024-10-13 06:35:58,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-13 06:35:58,217 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:35:58,217 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:35:58,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 06:35:58,217 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:35:58,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:35:58,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1162236377, now seen corresponding path program 1 times [2024-10-13 06:35:58,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:35:58,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253871960] [2024-10-13 06:35:58,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:35:58,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:35:58,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:58,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:35:58,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:58,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:35:58,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:58,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:35:58,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:58,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:35:58,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:58,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:35:58,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:58,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:35:58,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:58,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:35:58,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:58,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:35:58,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:58,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:35:58,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:58,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:35:58,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:58,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:35:58,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:58,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:35:58,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:58,523 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:35:58,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:35:58,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253871960] [2024-10-13 06:35:58,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253871960] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:35:58,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:35:58,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:35:58,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751369146] [2024-10-13 06:35:58,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:35:58,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:35:58,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:35:58,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:35:58,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:35:58,526 INFO L87 Difference]: Start difference. First operand 180 states and 256 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:35:58,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:35:58,693 INFO L93 Difference]: Finished difference Result 395 states and 560 transitions. [2024-10-13 06:35:58,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:35:58,694 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2024-10-13 06:35:58,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:35:58,695 INFO L225 Difference]: With dead ends: 395 [2024-10-13 06:35:58,695 INFO L226 Difference]: Without dead ends: 216 [2024-10-13 06:35:58,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:35:58,696 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 41 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:35:58,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 460 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:35:58,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-10-13 06:35:58,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 193. [2024-10-13 06:35:58,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 179 states have (on average 1.3910614525139664) internal successors, (249), 179 states have internal predecessors, (249), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 06:35:58,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 273 transitions. [2024-10-13 06:35:58,711 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 273 transitions. Word has length 114 [2024-10-13 06:35:58,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:35:58,711 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 273 transitions. [2024-10-13 06:35:58,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:35:58,712 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 273 transitions. [2024-10-13 06:35:58,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-13 06:35:58,713 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:35:58,713 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:35:58,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 06:35:58,713 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:35:58,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:35:58,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1010771952, now seen corresponding path program 1 times [2024-10-13 06:35:58,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:35:58,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974088848] [2024-10-13 06:35:58,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:35:58,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:35:58,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:59,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:35:59,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:59,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:35:59,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:59,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:35:59,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:59,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:35:59,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:59,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:35:59,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:59,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:35:59,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:59,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:35:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:59,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:35:59,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:59,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:35:59,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:59,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:35:59,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:59,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:35:59,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:59,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:35:59,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:59,880 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:35:59,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:35:59,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974088848] [2024-10-13 06:35:59,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974088848] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:35:59,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:35:59,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 06:35:59,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690924279] [2024-10-13 06:35:59,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:35:59,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 06:35:59,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:35:59,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 06:35:59,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:35:59,882 INFO L87 Difference]: Start difference. First operand 193 states and 273 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:36:00,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:36:00,568 INFO L93 Difference]: Finished difference Result 649 states and 915 transitions. [2024-10-13 06:36:00,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 06:36:00,568 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2024-10-13 06:36:00,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:36:00,571 INFO L225 Difference]: With dead ends: 649 [2024-10-13 06:36:00,571 INFO L226 Difference]: Without dead ends: 457 [2024-10-13 06:36:00,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-13 06:36:00,572 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 246 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 06:36:00,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 466 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 06:36:00,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2024-10-13 06:36:00,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 291. [2024-10-13 06:36:00,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 264 states have (on average 1.3825757575757576) internal successors, (365), 264 states have internal predecessors, (365), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 06:36:00,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 413 transitions. [2024-10-13 06:36:00,604 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 413 transitions. Word has length 114 [2024-10-13 06:36:00,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:36:00,605 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 413 transitions. [2024-10-13 06:36:00,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:36:00,605 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 413 transitions. [2024-10-13 06:36:00,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-13 06:36:00,606 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:36:00,606 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:36:00,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 06:36:00,607 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:36:00,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:36:00,607 INFO L85 PathProgramCache]: Analyzing trace with hash -617744942, now seen corresponding path program 1 times [2024-10-13 06:36:00,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:36:00,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940806216] [2024-10-13 06:36:00,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:36:00,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:36:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:01,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:36:01,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:01,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:36:01,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:01,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:36:01,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:01,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:36:01,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:01,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:36:01,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:01,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:36:01,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:01,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:36:01,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:01,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:36:01,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:01,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:36:01,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:01,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:36:01,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:01,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:36:01,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:01,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:36:01,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:01,671 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:36:01,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:36:01,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940806216] [2024-10-13 06:36:01,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940806216] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:36:01,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:36:01,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-13 06:36:01,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848686580] [2024-10-13 06:36:01,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:36:01,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 06:36:01,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:36:01,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 06:36:01,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-13 06:36:01,673 INFO L87 Difference]: Start difference. First operand 291 states and 413 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:36:02,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:36:02,531 INFO L93 Difference]: Finished difference Result 657 states and 926 transitions. [2024-10-13 06:36:02,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 06:36:02,532 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2024-10-13 06:36:02,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:36:02,535 INFO L225 Difference]: With dead ends: 657 [2024-10-13 06:36:02,535 INFO L226 Difference]: Without dead ends: 465 [2024-10-13 06:36:02,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2024-10-13 06:36:02,539 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 268 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 06:36:02,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 838 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 06:36:02,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2024-10-13 06:36:02,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 295. [2024-10-13 06:36:02,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 268 states have (on average 1.376865671641791) internal successors, (369), 268 states have internal predecessors, (369), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 06:36:02,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 417 transitions. [2024-10-13 06:36:02,586 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 417 transitions. Word has length 114 [2024-10-13 06:36:02,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:36:02,589 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 417 transitions. [2024-10-13 06:36:02,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:36:02,589 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 417 transitions. [2024-10-13 06:36:02,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-13 06:36:02,591 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:36:02,591 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:36:02,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 06:36:02,592 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:36:02,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:36:02,592 INFO L85 PathProgramCache]: Analyzing trace with hash -34649853, now seen corresponding path program 1 times [2024-10-13 06:36:02,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:36:02,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366419406] [2024-10-13 06:36:02,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:36:02,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:36:02,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:03,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:36:03,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:03,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:36:03,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:03,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:36:03,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:03,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:36:03,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:03,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:36:03,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:03,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:36:03,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:03,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:36:03,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:03,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:36:03,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:03,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:36:03,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:03,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:36:03,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:03,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:36:03,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:03,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:36:03,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:03,978 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:36:03,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:36:03,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366419406] [2024-10-13 06:36:03,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366419406] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:36:03,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:36:03,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 06:36:03,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552817432] [2024-10-13 06:36:03,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:36:03,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 06:36:03,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:36:03,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 06:36:03,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:36:03,983 INFO L87 Difference]: Start difference. First operand 295 states and 417 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:36:05,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:36:05,312 INFO L93 Difference]: Finished difference Result 697 states and 975 transitions. [2024-10-13 06:36:05,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 06:36:05,313 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2024-10-13 06:36:05,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:36:05,316 INFO L225 Difference]: With dead ends: 697 [2024-10-13 06:36:05,318 INFO L226 Difference]: Without dead ends: 496 [2024-10-13 06:36:05,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2024-10-13 06:36:05,319 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 316 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 1014 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 06:36:05,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 1068 Invalid, 1069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1014 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 06:36:05,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2024-10-13 06:36:05,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 295. [2024-10-13 06:36:05,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 268 states have (on average 1.373134328358209) internal successors, (368), 268 states have internal predecessors, (368), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 06:36:05,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 416 transitions. [2024-10-13 06:36:05,353 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 416 transitions. Word has length 114 [2024-10-13 06:36:05,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:36:05,354 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 416 transitions. [2024-10-13 06:36:05,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:36:05,354 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 416 transitions. [2024-10-13 06:36:05,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-13 06:36:05,356 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:36:05,356 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:36:05,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 06:36:05,357 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:36:05,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:36:05,357 INFO L85 PathProgramCache]: Analyzing trace with hash -551523215, now seen corresponding path program 1 times [2024-10-13 06:36:05,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:36:05,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815086591] [2024-10-13 06:36:05,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:36:05,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:36:05,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:06,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:36:06,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:06,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:36:06,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:06,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:36:06,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:06,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:36:06,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:06,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:36:06,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:06,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:36:06,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:06,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:36:06,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:06,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:36:06,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:06,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:36:06,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:06,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:36:06,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:06,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:36:06,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:06,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:36:06,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:06,344 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:36:06,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:36:06,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815086591] [2024-10-13 06:36:06,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815086591] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:36:06,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:36:06,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 06:36:06,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487208404] [2024-10-13 06:36:06,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:36:06,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 06:36:06,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:36:06,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 06:36:06,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:36:06,347 INFO L87 Difference]: Start difference. First operand 295 states and 416 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:36:06,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:36:06,727 INFO L93 Difference]: Finished difference Result 510 states and 719 transitions. [2024-10-13 06:36:06,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:36:06,728 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2024-10-13 06:36:06,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:36:06,731 INFO L225 Difference]: With dead ends: 510 [2024-10-13 06:36:06,731 INFO L226 Difference]: Without dead ends: 318 [2024-10-13 06:36:06,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-10-13 06:36:06,732 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 221 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:36:06,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 438 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:36:06,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-10-13 06:36:06,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 266. [2024-10-13 06:36:06,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 239 states have (on average 1.3556485355648535) internal successors, (324), 239 states have internal predecessors, (324), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 06:36:06,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 372 transitions. [2024-10-13 06:36:06,758 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 372 transitions. Word has length 114 [2024-10-13 06:36:06,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:36:06,758 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 372 transitions. [2024-10-13 06:36:06,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:36:06,758 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 372 transitions. [2024-10-13 06:36:06,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-13 06:36:06,760 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:36:06,760 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:36:06,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 06:36:06,760 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:36:06,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:36:06,761 INFO L85 PathProgramCache]: Analyzing trace with hash 912456082, now seen corresponding path program 1 times [2024-10-13 06:36:06,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:36:06,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037822387] [2024-10-13 06:36:06,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:36:06,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:36:06,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:07,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:36:07,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:07,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:36:07,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:07,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:36:07,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:07,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:36:07,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:07,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:36:07,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:07,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:36:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:07,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:36:07,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:07,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:36:07,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:07,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:36:07,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:07,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:36:07,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:07,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:36:07,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:07,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:36:07,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:07,957 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:36:07,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:36:07,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037822387] [2024-10-13 06:36:07,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037822387] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:36:07,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:36:07,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-13 06:36:07,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198597694] [2024-10-13 06:36:07,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:36:07,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 06:36:07,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:36:07,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 06:36:07,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-13 06:36:07,961 INFO L87 Difference]: Start difference. First operand 266 states and 372 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:36:08,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:36:08,694 INFO L93 Difference]: Finished difference Result 504 states and 702 transitions. [2024-10-13 06:36:08,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 06:36:08,695 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2024-10-13 06:36:08,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:36:08,697 INFO L225 Difference]: With dead ends: 504 [2024-10-13 06:36:08,697 INFO L226 Difference]: Without dead ends: 341 [2024-10-13 06:36:08,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2024-10-13 06:36:08,699 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 170 mSDsluCounter, 926 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 06:36:08,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 1062 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 851 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 06:36:08,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2024-10-13 06:36:08,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 313. [2024-10-13 06:36:08,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 286 states have (on average 1.3601398601398602) internal successors, (389), 286 states have internal predecessors, (389), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 06:36:08,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 437 transitions. [2024-10-13 06:36:08,726 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 437 transitions. Word has length 114 [2024-10-13 06:36:08,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:36:08,729 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 437 transitions. [2024-10-13 06:36:08,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:36:08,729 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 437 transitions. [2024-10-13 06:36:08,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-13 06:36:08,730 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:36:08,731 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:36:08,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 06:36:08,731 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:36:08,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:36:08,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1305483092, now seen corresponding path program 1 times [2024-10-13 06:36:08,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:36:08,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131349713] [2024-10-13 06:36:08,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:36:08,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:36:08,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:09,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:36:09,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:09,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:36:09,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:09,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:36:09,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:09,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:36:09,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:09,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:36:09,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:09,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:36:09,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:09,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:36:09,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:09,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:36:09,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:09,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:36:09,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:09,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:36:09,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:09,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:36:09,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:09,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:36:09,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:09,444 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:36:09,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:36:09,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131349713] [2024-10-13 06:36:09,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131349713] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:36:09,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:36:09,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:36:09,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84819697] [2024-10-13 06:36:09,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:36:09,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:36:09,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:36:09,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:36:09,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:36:09,446 INFO L87 Difference]: Start difference. First operand 313 states and 437 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:36:09,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:36:09,895 INFO L93 Difference]: Finished difference Result 553 states and 768 transitions. [2024-10-13 06:36:09,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:36:09,896 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2024-10-13 06:36:09,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:36:09,898 INFO L225 Difference]: With dead ends: 553 [2024-10-13 06:36:09,898 INFO L226 Difference]: Without dead ends: 339 [2024-10-13 06:36:09,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:36:09,900 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 185 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 06:36:09,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 505 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 06:36:09,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2024-10-13 06:36:09,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 313. [2024-10-13 06:36:09,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 286 states have (on average 1.3566433566433567) internal successors, (388), 286 states have internal predecessors, (388), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 06:36:09,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 436 transitions. [2024-10-13 06:36:09,927 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 436 transitions. Word has length 114 [2024-10-13 06:36:09,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:36:09,928 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 436 transitions. [2024-10-13 06:36:09,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:36:09,928 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 436 transitions. [2024-10-13 06:36:09,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-13 06:36:09,929 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:36:09,929 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:36:09,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 06:36:09,930 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:36:09,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:36:09,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1888578181, now seen corresponding path program 1 times [2024-10-13 06:36:09,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:36:09,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983464584] [2024-10-13 06:36:09,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:36:09,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:36:09,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:11,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:36:11,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:11,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:36:11,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:11,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:36:11,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:11,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:36:11,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:11,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:36:11,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:11,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:36:11,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:11,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:36:11,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:11,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:36:11,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:11,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:36:11,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:11,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:36:11,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:11,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:36:11,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:11,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:36:11,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:11,303 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:36:11,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:36:11,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983464584] [2024-10-13 06:36:11,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983464584] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:36:11,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:36:11,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-13 06:36:11,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419817014] [2024-10-13 06:36:11,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:36:11,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 06:36:11,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:36:11,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 06:36:11,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-13 06:36:11,305 INFO L87 Difference]: Start difference. First operand 313 states and 436 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:36:12,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:36:12,553 INFO L93 Difference]: Finished difference Result 746 states and 1025 transitions. [2024-10-13 06:36:12,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 06:36:12,555 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2024-10-13 06:36:12,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:36:12,558 INFO L225 Difference]: With dead ends: 746 [2024-10-13 06:36:12,558 INFO L226 Difference]: Without dead ends: 532 [2024-10-13 06:36:12,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2024-10-13 06:36:12,560 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 382 mSDsluCounter, 801 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 06:36:12,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 918 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 06:36:12,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2024-10-13 06:36:12,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 331. [2024-10-13 06:36:12,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 304 states have (on average 1.3585526315789473) internal successors, (413), 304 states have internal predecessors, (413), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 06:36:12,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 461 transitions. [2024-10-13 06:36:12,590 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 461 transitions. Word has length 114 [2024-10-13 06:36:12,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:36:12,591 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 461 transitions. [2024-10-13 06:36:12,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:36:12,591 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 461 transitions. [2024-10-13 06:36:12,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-13 06:36:12,593 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:36:12,593 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:36:12,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 06:36:12,593 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:36:12,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:36:12,594 INFO L85 PathProgramCache]: Analyzing trace with hash -865948523, now seen corresponding path program 1 times [2024-10-13 06:36:12,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:36:12,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984089359] [2024-10-13 06:36:12,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:36:12,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:36:12,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:13,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:36:13,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:13,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:36:13,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:13,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:36:13,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:13,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:36:13,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:13,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:36:13,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:13,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:36:13,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:13,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:36:13,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:13,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:36:13,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:13,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:36:13,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:13,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:36:13,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:13,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:36:13,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:13,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:36:13,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:13,766 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:36:13,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:36:13,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984089359] [2024-10-13 06:36:13,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984089359] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:36:13,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:36:13,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 06:36:13,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450576375] [2024-10-13 06:36:13,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:36:13,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 06:36:13,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:36:13,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 06:36:13,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:36:13,769 INFO L87 Difference]: Start difference. First operand 331 states and 461 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:36:14,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:36:14,943 INFO L93 Difference]: Finished difference Result 753 states and 1032 transitions. [2024-10-13 06:36:14,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 06:36:14,944 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-10-13 06:36:14,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:36:14,946 INFO L225 Difference]: With dead ends: 753 [2024-10-13 06:36:14,946 INFO L226 Difference]: Without dead ends: 532 [2024-10-13 06:36:14,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2024-10-13 06:36:14,948 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 316 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 1017 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 1074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 06:36:14,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 1064 Invalid, 1074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1017 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 06:36:14,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2024-10-13 06:36:14,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 331. [2024-10-13 06:36:14,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 304 states have (on average 1.355263157894737) internal successors, (412), 304 states have internal predecessors, (412), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 06:36:14,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 460 transitions. [2024-10-13 06:36:14,977 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 460 transitions. Word has length 115 [2024-10-13 06:36:14,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:36:14,978 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 460 transitions. [2024-10-13 06:36:14,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:36:14,978 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 460 transitions. [2024-10-13 06:36:14,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-13 06:36:14,980 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:36:14,980 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:36:14,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-13 06:36:14,981 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:36:14,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:36:14,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1375421613, now seen corresponding path program 1 times [2024-10-13 06:36:14,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:36:14,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5427967] [2024-10-13 06:36:14,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:36:14,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:36:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:16,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:36:16,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:16,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:36:16,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:16,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:36:16,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:16,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:36:16,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:16,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:36:16,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:16,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:36:16,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:16,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:36:16,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:16,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:36:16,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:16,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:36:16,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:16,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:36:16,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:16,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:36:16,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:16,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:36:16,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:16,515 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:36:16,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:36:16,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5427967] [2024-10-13 06:36:16,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5427967] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:36:16,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:36:16,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-13 06:36:16,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028863768] [2024-10-13 06:36:16,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:36:16,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 06:36:16,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:36:16,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 06:36:16,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-13 06:36:16,518 INFO L87 Difference]: Start difference. First operand 331 states and 460 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:36:17,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:36:17,716 INFO L93 Difference]: Finished difference Result 738 states and 1010 transitions. [2024-10-13 06:36:17,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 06:36:17,719 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-10-13 06:36:17,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:36:17,722 INFO L225 Difference]: With dead ends: 738 [2024-10-13 06:36:17,722 INFO L226 Difference]: Without dead ends: 524 [2024-10-13 06:36:17,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2024-10-13 06:36:17,727 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 360 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 1001 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 1058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 06:36:17,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 1023 Invalid, 1058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1001 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 06:36:17,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2024-10-13 06:36:17,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 341. [2024-10-13 06:36:17,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 314 states have (on average 1.3535031847133758) internal successors, (425), 314 states have internal predecessors, (425), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 06:36:17,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 473 transitions. [2024-10-13 06:36:17,760 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 473 transitions. Word has length 115 [2024-10-13 06:36:17,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:36:17,761 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 473 transitions. [2024-10-13 06:36:17,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:36:17,761 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 473 transitions. [2024-10-13 06:36:17,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-13 06:36:17,763 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:36:17,763 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:36:17,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-13 06:36:17,764 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:36:17,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:36:17,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1897854349, now seen corresponding path program 1 times [2024-10-13 06:36:17,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:36:17,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753474220] [2024-10-13 06:36:17,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:36:17,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:36:17,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:20,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:36:20,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:20,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:36:20,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:20,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:36:20,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:20,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:36:20,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:20,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:36:20,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:20,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:36:20,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:20,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:36:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:20,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:36:20,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:20,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:36:20,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:20,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:36:20,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:20,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:36:20,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:20,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:36:21,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:21,010 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:36:21,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:36:21,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753474220] [2024-10-13 06:36:21,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753474220] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:36:21,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:36:21,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-13 06:36:21,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612101341] [2024-10-13 06:36:21,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:36:21,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-13 06:36:21,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:36:21,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-13 06:36:21,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2024-10-13 06:36:21,013 INFO L87 Difference]: Start difference. First operand 341 states and 473 transitions. Second operand has 16 states, 15 states have (on average 3.933333333333333) internal successors, (59), 16 states have internal predecessors, (59), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-13 06:36:23,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:36:23,740 INFO L93 Difference]: Finished difference Result 723 states and 998 transitions. [2024-10-13 06:36:23,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 06:36:23,741 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.933333333333333) internal successors, (59), 16 states have internal predecessors, (59), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 116 [2024-10-13 06:36:23,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:36:23,744 INFO L225 Difference]: With dead ends: 723 [2024-10-13 06:36:23,745 INFO L226 Difference]: Without dead ends: 509 [2024-10-13 06:36:23,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2024-10-13 06:36:23,747 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 444 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 1199 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 1104 SdHoareTripleChecker+Invalid, 1282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:36:23,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 1104 Invalid, 1282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1199 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-13 06:36:23,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2024-10-13 06:36:23,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 377. [2024-10-13 06:36:23,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 349 states have (on average 1.3495702005730659) internal successors, (471), 349 states have internal predecessors, (471), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 06:36:23,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 519 transitions. [2024-10-13 06:36:23,786 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 519 transitions. Word has length 116 [2024-10-13 06:36:23,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:36:23,787 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 519 transitions. [2024-10-13 06:36:23,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.933333333333333) internal successors, (59), 16 states have internal predecessors, (59), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-13 06:36:23,788 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 519 transitions. [2024-10-13 06:36:23,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-13 06:36:23,789 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:36:23,789 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:36:23,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-13 06:36:23,790 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:36:23,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:36:23,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1757305739, now seen corresponding path program 1 times [2024-10-13 06:36:23,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:36:23,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134042464] [2024-10-13 06:36:23,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:36:23,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:36:23,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:24,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:36:24,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:24,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:36:24,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:24,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:36:24,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:24,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:36:24,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:24,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:36:24,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:24,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:36:24,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:24,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:36:24,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:24,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:36:24,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:24,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:36:24,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:24,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:36:24,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:24,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:36:24,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:24,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:36:24,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:24,896 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:36:24,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:36:24,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134042464] [2024-10-13 06:36:24,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134042464] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:36:24,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:36:24,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 06:36:24,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585090623] [2024-10-13 06:36:24,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:36:24,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 06:36:24,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:36:24,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 06:36:24,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:36:24,900 INFO L87 Difference]: Start difference. First operand 377 states and 519 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:36:25,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:36:25,321 INFO L93 Difference]: Finished difference Result 677 states and 926 transitions. [2024-10-13 06:36:25,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:36:25,324 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2024-10-13 06:36:25,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:36:25,326 INFO L225 Difference]: With dead ends: 677 [2024-10-13 06:36:25,326 INFO L226 Difference]: Without dead ends: 427 [2024-10-13 06:36:25,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-13 06:36:25,327 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 329 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:36:25,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 483 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:36:25,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2024-10-13 06:36:25,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 334. [2024-10-13 06:36:25,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 306 states have (on average 1.3398692810457515) internal successors, (410), 306 states have internal predecessors, (410), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 06:36:25,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 458 transitions. [2024-10-13 06:36:25,378 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 458 transitions. Word has length 116 [2024-10-13 06:36:25,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:36:25,378 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 458 transitions. [2024-10-13 06:36:25,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:36:25,379 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 458 transitions. [2024-10-13 06:36:25,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-13 06:36:25,380 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:36:25,380 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:36:25,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-13 06:36:25,380 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:36:25,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:36:25,382 INFO L85 PathProgramCache]: Analyzing trace with hash -724104864, now seen corresponding path program 1 times [2024-10-13 06:36:25,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:36:25,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604585255] [2024-10-13 06:36:25,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:36:25,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:36:25,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:25,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:36:25,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:25,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:36:25,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:25,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:36:25,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:25,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:36:25,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:25,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:36:25,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:25,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:36:25,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:25,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:36:25,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:25,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:36:25,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:25,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:36:25,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:25,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:36:25,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:25,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:36:25,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:25,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:36:25,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:25,543 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:36:25,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:36:25,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604585255] [2024-10-13 06:36:25,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604585255] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:36:25,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:36:25,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:36:25,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326449352] [2024-10-13 06:36:25,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:36:25,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:36:25,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:36:25,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:36:25,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:36:25,545 INFO L87 Difference]: Start difference. First operand 334 states and 458 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:36:25,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:36:25,602 INFO L93 Difference]: Finished difference Result 555 states and 758 transitions. [2024-10-13 06:36:25,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:36:25,603 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2024-10-13 06:36:25,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:36:25,605 INFO L225 Difference]: With dead ends: 555 [2024-10-13 06:36:25,605 INFO L226 Difference]: Without dead ends: 337 [2024-10-13 06:36:25,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:36:25,606 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:36:25,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 570 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:36:25,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-10-13 06:36:25,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2024-10-13 06:36:25,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 309 states have (on average 1.3365695792880259) internal successors, (413), 309 states have internal predecessors, (413), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 06:36:25,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 461 transitions. [2024-10-13 06:36:25,642 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 461 transitions. Word has length 116 [2024-10-13 06:36:25,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:36:25,642 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 461 transitions. [2024-10-13 06:36:25,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:36:25,642 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 461 transitions. [2024-10-13 06:36:25,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-13 06:36:25,644 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:36:25,644 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:36:25,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-13 06:36:25,644 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:36:25,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:36:25,645 INFO L85 PathProgramCache]: Analyzing trace with hash 263277342, now seen corresponding path program 1 times [2024-10-13 06:36:25,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:36:25,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817115070] [2024-10-13 06:36:25,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:36:25,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:36:25,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:26,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:36:26,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:26,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:36:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:26,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:36:26,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:26,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:36:26,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:26,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:36:26,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:26,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:36:26,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:26,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:36:26,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:26,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:36:26,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:26,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:36:26,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:26,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:36:26,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:26,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:36:26,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:26,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:36:26,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:26,196 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:36:26,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:36:26,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817115070] [2024-10-13 06:36:26,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817115070] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:36:26,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:36:26,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 06:36:26,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502618691] [2024-10-13 06:36:26,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:36:26,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 06:36:26,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:36:26,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 06:36:26,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-13 06:36:26,201 INFO L87 Difference]: Start difference. First operand 337 states and 461 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 06:36:26,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:36:26,694 INFO L93 Difference]: Finished difference Result 678 states and 913 transitions. [2024-10-13 06:36:26,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 06:36:26,695 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 116 [2024-10-13 06:36:26,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:36:26,698 INFO L225 Difference]: With dead ends: 678 [2024-10-13 06:36:26,698 INFO L226 Difference]: Without dead ends: 457 [2024-10-13 06:36:26,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2024-10-13 06:36:26,701 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 340 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:36:26,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 646 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:36:26,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2024-10-13 06:36:26,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 385. [2024-10-13 06:36:26,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 357 states have (on average 1.3361344537815125) internal successors, (477), 357 states have internal predecessors, (477), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 06:36:26,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 525 transitions. [2024-10-13 06:36:26,737 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 525 transitions. Word has length 116 [2024-10-13 06:36:26,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:36:26,738 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 525 transitions. [2024-10-13 06:36:26,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 06:36:26,738 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 525 transitions. [2024-10-13 06:36:26,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-13 06:36:26,739 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:36:26,739 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:36:26,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-13 06:36:26,739 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:36:26,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:36:26,740 INFO L85 PathProgramCache]: Analyzing trace with hash 685979168, now seen corresponding path program 1 times [2024-10-13 06:36:26,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:36:26,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538384591] [2024-10-13 06:36:26,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:36:26,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:36:26,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:27,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:36:27,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:27,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:36:27,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:27,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:36:27,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:27,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:36:27,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:27,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:36:27,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:27,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:36:27,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:27,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:36:27,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:27,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:36:27,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:27,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:36:27,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:27,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:36:27,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:27,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:36:27,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:27,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:36:27,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:27,759 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:36:27,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:36:27,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538384591] [2024-10-13 06:36:27,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538384591] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:36:27,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:36:27,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-13 06:36:27,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114382065] [2024-10-13 06:36:27,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:36:27,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 06:36:27,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:36:27,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 06:36:27,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-13 06:36:27,762 INFO L87 Difference]: Start difference. First operand 385 states and 525 transitions. Second operand has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 12 states have internal predecessors, (59), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-13 06:36:28,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:36:28,307 INFO L93 Difference]: Finished difference Result 713 states and 955 transitions. [2024-10-13 06:36:28,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:36:28,308 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 12 states have internal predecessors, (59), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 116 [2024-10-13 06:36:28,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:36:28,310 INFO L225 Difference]: With dead ends: 713 [2024-10-13 06:36:28,310 INFO L226 Difference]: Without dead ends: 450 [2024-10-13 06:36:28,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2024-10-13 06:36:28,311 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 283 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 06:36:28,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 581 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 06:36:28,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2024-10-13 06:36:28,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 447. [2024-10-13 06:36:28,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 415 states have (on average 1.308433734939759) internal successors, (543), 416 states have internal predecessors, (543), 26 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 06:36:28,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 595 transitions. [2024-10-13 06:36:28,372 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 595 transitions. Word has length 116 [2024-10-13 06:36:28,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:36:28,372 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 595 transitions. [2024-10-13 06:36:28,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 12 states have internal predecessors, (59), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-13 06:36:28,372 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 595 transitions. [2024-10-13 06:36:28,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-13 06:36:28,373 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:36:28,374 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:36:28,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-13 06:36:28,374 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:36:28,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:36:28,374 INFO L85 PathProgramCache]: Analyzing trace with hash -580999627, now seen corresponding path program 1 times [2024-10-13 06:36:28,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:36:28,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374474613] [2024-10-13 06:36:28,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:36:28,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:36:28,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:28,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:36:28,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:28,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:36:28,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:28,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:36:28,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:28,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:36:28,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:28,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:36:28,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:28,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:36:28,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:28,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:36:28,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:28,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:36:28,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:28,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:36:28,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:28,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:36:28,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:28,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:36:28,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:28,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:36:28,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:28,693 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:36:28,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:36:28,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374474613] [2024-10-13 06:36:28,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374474613] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:36:28,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:36:28,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:36:28,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139778352] [2024-10-13 06:36:28,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:36:28,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:36:28,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:36:28,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:36:28,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:36:28,696 INFO L87 Difference]: Start difference. First operand 447 states and 595 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:36:28,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:36:28,912 INFO L93 Difference]: Finished difference Result 758 states and 1006 transitions. [2024-10-13 06:36:28,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:36:28,913 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2024-10-13 06:36:28,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:36:28,917 INFO L225 Difference]: With dead ends: 758 [2024-10-13 06:36:28,917 INFO L226 Difference]: Without dead ends: 445 [2024-10-13 06:36:28,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:36:28,918 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 148 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:36:28,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 417 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:36:28,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2024-10-13 06:36:28,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2024-10-13 06:36:28,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 413 states have (on average 1.297820823244552) internal successors, (536), 414 states have internal predecessors, (536), 26 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 06:36:28,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 588 transitions. [2024-10-13 06:36:28,963 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 588 transitions. Word has length 116 [2024-10-13 06:36:28,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:36:28,963 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 588 transitions. [2024-10-13 06:36:28,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:36:28,963 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 588 transitions. [2024-10-13 06:36:28,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-13 06:36:28,964 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:36:28,965 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:36:28,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-13 06:36:28,965 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:36:28,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:36:28,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1773000673, now seen corresponding path program 1 times [2024-10-13 06:36:28,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:36:28,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184002101] [2024-10-13 06:36:28,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:36:28,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:36:29,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:31,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:36:31,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:31,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:36:31,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:31,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:36:31,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:31,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:36:31,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:31,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:36:31,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:31,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:36:31,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:31,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:36:31,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:31,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:36:31,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:31,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:36:31,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:31,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:36:31,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:31,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:36:31,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:31,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:36:31,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:31,230 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:36:31,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:36:31,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184002101] [2024-10-13 06:36:31,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184002101] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:36:31,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:36:31,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-13 06:36:31,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796639205] [2024-10-13 06:36:31,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:36:31,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 06:36:31,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:36:31,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 06:36:31,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-10-13 06:36:31,232 INFO L87 Difference]: Start difference. First operand 445 states and 588 transitions. Second operand has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-13 06:36:32,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:36:32,714 INFO L93 Difference]: Finished difference Result 890 states and 1172 transitions. [2024-10-13 06:36:32,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 06:36:32,715 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 117 [2024-10-13 06:36:32,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:36:32,718 INFO L225 Difference]: With dead ends: 890 [2024-10-13 06:36:32,718 INFO L226 Difference]: Without dead ends: 579 [2024-10-13 06:36:32,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2024-10-13 06:36:32,724 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 356 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 1022 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 1042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 06:36:32,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 962 Invalid, 1042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1022 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 06:36:32,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2024-10-13 06:36:32,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 460. [2024-10-13 06:36:32,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 428 states have (on average 1.2967289719626167) internal successors, (555), 429 states have internal predecessors, (555), 26 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 06:36:32,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 607 transitions. [2024-10-13 06:36:32,793 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 607 transitions. Word has length 117 [2024-10-13 06:36:32,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:36:32,795 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 607 transitions. [2024-10-13 06:36:32,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-13 06:36:32,795 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 607 transitions. [2024-10-13 06:36:32,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-13 06:36:32,797 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:36:32,797 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:36:32,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-13 06:36:32,797 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:36:32,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:36:32,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1835040287, now seen corresponding path program 1 times [2024-10-13 06:36:32,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:36:32,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346977915] [2024-10-13 06:36:32,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:36:32,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:36:32,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:35,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:36:35,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:35,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:36:35,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:35,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:36:35,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:35,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:36:35,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:35,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:36:35,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:35,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:36:35,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:35,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:36:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:35,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:36:35,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:35,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:36:35,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:35,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:36:35,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:35,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:36:35,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:35,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:36:35,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:35,580 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:36:35,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:36:35,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346977915] [2024-10-13 06:36:35,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346977915] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:36:35,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:36:35,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-13 06:36:35,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089569803] [2024-10-13 06:36:35,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:36:35,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-13 06:36:35,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:36:35,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-13 06:36:35,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-10-13 06:36:35,583 INFO L87 Difference]: Start difference. First operand 460 states and 607 transitions. Second operand has 17 states, 15 states have (on average 4.0) internal successors, (60), 17 states have internal predecessors, (60), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) [2024-10-13 06:36:38,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:36:38,197 INFO L93 Difference]: Finished difference Result 900 states and 1183 transitions. [2024-10-13 06:36:38,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 06:36:38,197 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 4.0) internal successors, (60), 17 states have internal predecessors, (60), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) Word has length 117 [2024-10-13 06:36:38,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:36:38,200 INFO L225 Difference]: With dead ends: 900 [2024-10-13 06:36:38,200 INFO L226 Difference]: Without dead ends: 574 [2024-10-13 06:36:38,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=101, Invalid=451, Unknown=0, NotChecked=0, Total=552 [2024-10-13 06:36:38,202 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 389 mSDsluCounter, 1098 mSDsCounter, 0 mSdLazyCounter, 1353 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 1222 SdHoareTripleChecker+Invalid, 1409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 06:36:38,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 1222 Invalid, 1409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1353 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 06:36:38,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2024-10-13 06:36:38,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 440. [2024-10-13 06:36:38,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 408 states have (on average 1.2941176470588236) internal successors, (528), 409 states have internal predecessors, (528), 26 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 06:36:38,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 580 transitions. [2024-10-13 06:36:38,241 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 580 transitions. Word has length 117 [2024-10-13 06:36:38,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:36:38,242 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 580 transitions. [2024-10-13 06:36:38,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 4.0) internal successors, (60), 17 states have internal predecessors, (60), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 5 states have call successors, (12) [2024-10-13 06:36:38,242 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 580 transitions. [2024-10-13 06:36:38,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-13 06:36:38,243 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:36:38,244 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:36:38,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-13 06:36:38,244 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:36:38,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:36:38,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1486980389, now seen corresponding path program 1 times [2024-10-13 06:36:38,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:36:38,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947073295] [2024-10-13 06:36:38,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:36:38,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:36:38,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:38,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:36:38,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:38,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:36:38,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:38,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:36:38,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:38,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:36:38,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:38,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:36:38,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:38,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:36:38,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:38,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:36:38,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:38,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:36:38,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:38,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:36:38,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:38,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:36:38,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:38,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:36:38,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:38,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:36:38,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:38,435 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:36:38,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:36:38,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947073295] [2024-10-13 06:36:38,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947073295] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:36:38,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:36:38,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:36:38,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636736747] [2024-10-13 06:36:38,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:36:38,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:36:38,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:36:38,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:36:38,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:36:38,438 INFO L87 Difference]: Start difference. First operand 440 states and 580 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:36:38,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:36:38,593 INFO L93 Difference]: Finished difference Result 790 states and 1040 transitions. [2024-10-13 06:36:38,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:36:38,594 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2024-10-13 06:36:38,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:36:38,596 INFO L225 Difference]: With dead ends: 790 [2024-10-13 06:36:38,596 INFO L226 Difference]: Without dead ends: 484 [2024-10-13 06:36:38,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:36:38,598 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 31 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:36:38,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 474 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:36:38,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2024-10-13 06:36:38,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 452. [2024-10-13 06:36:38,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 420 states have (on average 1.2952380952380953) internal successors, (544), 421 states have internal predecessors, (544), 26 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 06:36:38,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 596 transitions. [2024-10-13 06:36:38,659 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 596 transitions. Word has length 118 [2024-10-13 06:36:38,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:36:38,659 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 596 transitions. [2024-10-13 06:36:38,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:36:38,659 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 596 transitions. [2024-10-13 06:36:38,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-13 06:36:38,660 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:36:38,660 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:36:38,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-13 06:36:38,660 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:36:38,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:36:38,661 INFO L85 PathProgramCache]: Analyzing trace with hash 877622157, now seen corresponding path program 1 times [2024-10-13 06:36:38,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:36:38,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502325747] [2024-10-13 06:36:38,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:36:38,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:36:38,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:39,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:36:39,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:39,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:36:39,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:39,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:36:39,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:39,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:36:39,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:39,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:36:39,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:39,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:36:39,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:39,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:36:39,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:39,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:36:39,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:39,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:36:39,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:39,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:36:39,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:39,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:36:39,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:39,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:36:39,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:39,875 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:36:39,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:36:39,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502325747] [2024-10-13 06:36:39,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502325747] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:36:39,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:36:39,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-13 06:36:39,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192038904] [2024-10-13 06:36:39,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:36:39,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 06:36:39,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:36:39,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 06:36:39,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-10-13 06:36:39,877 INFO L87 Difference]: Start difference. First operand 452 states and 596 transitions. Second operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:36:40,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:36:40,522 INFO L93 Difference]: Finished difference Result 808 states and 1062 transitions. [2024-10-13 06:36:40,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 06:36:40,522 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2024-10-13 06:36:40,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:36:40,524 INFO L225 Difference]: With dead ends: 808 [2024-10-13 06:36:40,525 INFO L226 Difference]: Without dead ends: 490 [2024-10-13 06:36:40,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2024-10-13 06:36:40,526 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 160 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 06:36:40,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 1066 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 06:36:40,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2024-10-13 06:36:40,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 458. [2024-10-13 06:36:40,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 426 states have (on average 1.2910798122065728) internal successors, (550), 427 states have internal predecessors, (550), 26 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 06:36:40,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 602 transitions. [2024-10-13 06:36:40,573 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 602 transitions. Word has length 119 [2024-10-13 06:36:40,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:36:40,573 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 602 transitions. [2024-10-13 06:36:40,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:36:40,574 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 602 transitions. [2024-10-13 06:36:40,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-13 06:36:40,575 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:36:40,575 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:36:40,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-13 06:36:40,575 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:36:40,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:36:40,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1029086582, now seen corresponding path program 1 times [2024-10-13 06:36:40,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:36:40,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132726073] [2024-10-13 06:36:40,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:36:40,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:36:40,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:40,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:36:40,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:40,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:36:40,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:40,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:36:40,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:40,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:36:40,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:40,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:36:40,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:40,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:36:40,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:40,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:36:40,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:40,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:36:40,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:40,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:36:40,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:40,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:36:40,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:40,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:36:40,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:40,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:36:40,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:40,727 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:36:40,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:36:40,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132726073] [2024-10-13 06:36:40,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132726073] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:36:40,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:36:40,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:36:40,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302506810] [2024-10-13 06:36:40,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:36:40,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:36:40,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:36:40,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:36:40,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:36:40,729 INFO L87 Difference]: Start difference. First operand 458 states and 602 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:36:40,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:36:40,845 INFO L93 Difference]: Finished difference Result 804 states and 1052 transitions. [2024-10-13 06:36:40,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:36:40,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2024-10-13 06:36:40,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:36:40,848 INFO L225 Difference]: With dead ends: 804 [2024-10-13 06:36:40,849 INFO L226 Difference]: Without dead ends: 480 [2024-10-13 06:36:40,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:36:40,850 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 68 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:36:40,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 419 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:36:40,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2024-10-13 06:36:40,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 448. [2024-10-13 06:36:40,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 416 states have (on average 1.2836538461538463) internal successors, (534), 417 states have internal predecessors, (534), 26 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 06:36:40,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 586 transitions. [2024-10-13 06:36:40,893 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 586 transitions. Word has length 119 [2024-10-13 06:36:40,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:36:40,894 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 586 transitions. [2024-10-13 06:36:40,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 06:36:40,894 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 586 transitions. [2024-10-13 06:36:40,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-13 06:36:40,895 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:36:40,895 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:36:40,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-13 06:36:40,895 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:36:40,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:36:40,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1101082135, now seen corresponding path program 1 times [2024-10-13 06:36:40,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:36:40,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225141586] [2024-10-13 06:36:40,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:36:40,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:36:40,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:41,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:36:41,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:41,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:36:41,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:41,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:36:41,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:41,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:36:41,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:41,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:36:41,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:41,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:36:41,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:41,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:36:41,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:41,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:36:41,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:41,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:36:41,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:41,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:36:41,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:41,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:36:41,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:41,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:36:41,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:41,576 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:36:41,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:36:41,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225141586] [2024-10-13 06:36:41,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225141586] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:36:41,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:36:41,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 06:36:41,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388335287] [2024-10-13 06:36:41,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:36:41,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 06:36:41,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:36:41,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 06:36:41,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:36:41,578 INFO L87 Difference]: Start difference. First operand 448 states and 586 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 06:36:41,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:36:41,832 INFO L93 Difference]: Finished difference Result 779 states and 1015 transitions. [2024-10-13 06:36:41,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:36:41,833 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 120 [2024-10-13 06:36:41,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:36:41,834 INFO L225 Difference]: With dead ends: 779 [2024-10-13 06:36:41,834 INFO L226 Difference]: Without dead ends: 452 [2024-10-13 06:36:41,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:36:41,835 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 106 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:36:41,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 521 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:36:41,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2024-10-13 06:36:41,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 439. [2024-10-13 06:36:41,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 407 states have (on average 1.2776412776412776) internal successors, (520), 408 states have internal predecessors, (520), 26 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 06:36:41,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 572 transitions. [2024-10-13 06:36:41,868 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 572 transitions. Word has length 120 [2024-10-13 06:36:41,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:36:41,869 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 572 transitions. [2024-10-13 06:36:41,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 06:36:41,869 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 572 transitions. [2024-10-13 06:36:41,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-13 06:36:41,870 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:36:41,870 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:36:41,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-13 06:36:41,870 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:36:41,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:36:41,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1942266646, now seen corresponding path program 1 times [2024-10-13 06:36:41,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:36:41,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558518968] [2024-10-13 06:36:41,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:36:41,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:36:41,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:44,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:36:44,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:44,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:36:44,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:44,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:36:44,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:44,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:36:44,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:44,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:36:44,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:44,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:36:44,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:44,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:36:44,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:44,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:36:44,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:44,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:36:44,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:44,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:36:44,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:44,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:36:44,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:44,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:36:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:44,754 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 06:36:44,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:36:44,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558518968] [2024-10-13 06:36:44,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558518968] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:36:44,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:36:44,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-13 06:36:44,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124495716] [2024-10-13 06:36:44,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:36:44,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-13 06:36:44,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:36:44,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-13 06:36:44,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2024-10-13 06:36:44,757 INFO L87 Difference]: Start difference. First operand 439 states and 572 transitions. Second operand has 17 states, 16 states have (on average 4.125) internal successors, (66), 17 states have internal predecessors, (66), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-13 06:36:46,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:36:46,231 INFO L93 Difference]: Finished difference Result 859 states and 1112 transitions. [2024-10-13 06:36:46,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-13 06:36:46,232 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.125) internal successors, (66), 17 states have internal predecessors, (66), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 123 [2024-10-13 06:36:46,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:36:46,234 INFO L225 Difference]: With dead ends: 859 [2024-10-13 06:36:46,234 INFO L226 Difference]: Without dead ends: 545 [2024-10-13 06:36:46,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=151, Invalid=661, Unknown=0, NotChecked=0, Total=812 [2024-10-13 06:36:46,235 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 358 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 1011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 06:36:46,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 956 Invalid, 1011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 991 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 06:36:46,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2024-10-13 06:36:46,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 503. [2024-10-13 06:36:46,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 471 states have (on average 1.2738853503184713) internal successors, (600), 472 states have internal predecessors, (600), 26 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 06:36:46,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 652 transitions. [2024-10-13 06:36:46,284 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 652 transitions. Word has length 123 [2024-10-13 06:36:46,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:36:46,284 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 652 transitions. [2024-10-13 06:36:46,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.125) internal successors, (66), 17 states have internal predecessors, (66), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-13 06:36:46,285 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 652 transitions. [2024-10-13 06:36:46,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-13 06:36:46,286 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:36:46,286 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:36:46,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-13 06:36:46,286 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:36:46,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:36:46,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1132920020, now seen corresponding path program 1 times [2024-10-13 06:36:46,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:36:46,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874363785] [2024-10-13 06:36:46,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:36:46,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:36:46,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat