./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-53.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-53.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 760c1d743f5a1ad25ea52dedd60162abae8ccc16a1aae8053ec51960a678eda5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 14:00:45,915 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 14:00:45,961 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 14:00:45,967 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 14:00:45,968 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 14:00:45,992 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 14:00:45,993 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 14:00:45,993 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 14:00:45,994 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 14:00:45,995 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 14:00:45,996 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 14:00:45,996 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 14:00:45,996 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 14:00:45,997 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 14:00:45,998 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 14:00:45,998 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 14:00:45,998 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 14:00:45,999 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 14:00:45,999 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 14:00:45,999 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 14:00:45,999 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 14:00:46,002 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 14:00:46,002 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 14:00:46,003 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 14:00:46,003 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 14:00:46,003 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 14:00:46,003 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 14:00:46,003 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 14:00:46,004 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 14:00:46,004 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 14:00:46,004 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 14:00:46,004 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 14:00:46,004 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:00:46,004 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 14:00:46,005 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 14:00:46,005 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 14:00:46,005 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 14:00:46,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 14:00:46,005 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 14:00:46,006 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 14:00:46,006 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 14:00:46,007 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 14:00:46,007 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 760c1d743f5a1ad25ea52dedd60162abae8ccc16a1aae8053ec51960a678eda5 [2024-10-11 14:00:46,215 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 14:00:46,231 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 14:00:46,233 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 14:00:46,234 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 14:00:46,235 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 14:00:46,235 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-53.i [2024-10-11 14:00:47,484 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 14:00:47,680 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 14:00:47,681 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-53.i [2024-10-11 14:00:47,691 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e39e2fa98/93c01d8388444a5491818139485a36bc/FLAGd33262ecd [2024-10-11 14:00:48,057 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e39e2fa98/93c01d8388444a5491818139485a36bc [2024-10-11 14:00:48,059 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 14:00:48,060 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 14:00:48,062 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 14:00:48,062 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 14:00:48,067 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 14:00:48,067 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:00:48" (1/1) ... [2024-10-11 14:00:48,068 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c56b860 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:00:48, skipping insertion in model container [2024-10-11 14:00:48,068 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:00:48" (1/1) ... [2024-10-11 14:00:48,093 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 14:00:48,229 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-53.i[917,930] [2024-10-11 14:00:48,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:00:48,291 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 14:00:48,323 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-53.i[917,930] [2024-10-11 14:00:48,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:00:48,405 INFO L204 MainTranslator]: Completed translation [2024-10-11 14:00:48,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:00:48 WrapperNode [2024-10-11 14:00:48,408 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 14:00:48,409 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 14:00:48,409 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 14:00:48,409 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 14:00:48,415 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:00:48" (1/1) ... [2024-10-11 14:00:48,426 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:00:48" (1/1) ... [2024-10-11 14:00:48,454 INFO L138 Inliner]: procedures = 29, calls = 163, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 500 [2024-10-11 14:00:48,454 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 14:00:48,455 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 14:00:48,455 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 14:00:48,455 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 14:00:48,464 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:00:48" (1/1) ... [2024-10-11 14:00:48,464 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:00:48" (1/1) ... [2024-10-11 14:00:48,474 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:00:48" (1/1) ... [2024-10-11 14:00:48,496 INFO L175 MemorySlicer]: Split 133 memory accesses to 2 slices as follows [2, 131]. 98 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 15]. The 18 writes are split as follows [0, 18]. [2024-10-11 14:00:48,496 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:00:48" (1/1) ... [2024-10-11 14:00:48,496 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:00:48" (1/1) ... [2024-10-11 14:00:48,508 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:00:48" (1/1) ... [2024-10-11 14:00:48,515 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:00:48" (1/1) ... [2024-10-11 14:00:48,518 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:00:48" (1/1) ... [2024-10-11 14:00:48,520 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:00:48" (1/1) ... [2024-10-11 14:00:48,528 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 14:00:48,529 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 14:00:48,529 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 14:00:48,529 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 14:00:48,532 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:00:48" (1/1) ... [2024-10-11 14:00:48,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:00:48,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:00:48,566 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 14:00:48,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 14:00:48,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 14:00:48,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-11 14:00:48,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-11 14:00:48,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 14:00:48,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 14:00:48,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 14:00:48,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 14:00:48,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 14:00:48,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 14:00:48,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-11 14:00:48,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-11 14:00:48,609 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 14:00:48,609 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 14:00:48,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 14:00:48,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 14:00:48,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 14:00:48,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 14:00:48,731 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 14:00:48,734 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 14:00:49,141 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2024-10-11 14:00:49,141 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 14:00:49,163 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 14:00:49,163 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 14:00:49,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:00:49 BoogieIcfgContainer [2024-10-11 14:00:49,164 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 14:00:49,165 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 14:00:49,165 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 14:00:49,168 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 14:00:49,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:00:48" (1/3) ... [2024-10-11 14:00:49,169 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29a0df5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:00:49, skipping insertion in model container [2024-10-11 14:00:49,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:00:48" (2/3) ... [2024-10-11 14:00:49,169 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29a0df5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:00:49, skipping insertion in model container [2024-10-11 14:00:49,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:00:49" (3/3) ... [2024-10-11 14:00:49,170 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-53.i [2024-10-11 14:00:49,182 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 14:00:49,183 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 14:00:49,226 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:00:49,232 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;@32567c00, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:00:49,232 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 14:00:49,236 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 84 states have (on average 1.4404761904761905) internal successors, (121), 85 states have internal predecessors, (121), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 14:00:49,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-11 14:00:49,248 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:00:49,249 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:00:49,249 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:00:49,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:00:49,256 INFO L85 PathProgramCache]: Analyzing trace with hash -40687976, now seen corresponding path program 1 times [2024-10-11 14:00:49,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:00:49,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743086957] [2024-10-11 14:00:49,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:00:49,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:00:49,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:49,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:00:49,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:49,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:00:49,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:49,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:00:49,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:49,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:00:49,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:49,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:00:49,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:49,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:00:49,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:49,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:00:49,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:49,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:00:49,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:49,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:00:49,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:49,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:00:49,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:49,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:00:49,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:49,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:00:49,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:49,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:00:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:49,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:00:49,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:49,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:00:49,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:49,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:00:49,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:49,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:00:49,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:49,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:00:49,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:49,698 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 14:00:49,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:00:49,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743086957] [2024-10-11 14:00:49,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743086957] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:00:49,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:00:49,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 14:00:49,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077645203] [2024-10-11 14:00:49,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:00:49,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 14:00:49,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:00:49,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 14:00:49,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 14:00:49,720 INFO L87 Difference]: Start difference. First operand has 105 states, 84 states have (on average 1.4404761904761905) internal successors, (121), 85 states have internal predecessors, (121), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 14:00:49,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:00:49,776 INFO L93 Difference]: Finished difference Result 207 states and 330 transitions. [2024-10-11 14:00:49,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 14:00:49,777 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 135 [2024-10-11 14:00:49,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:00:49,783 INFO L225 Difference]: With dead ends: 207 [2024-10-11 14:00:49,783 INFO L226 Difference]: Without dead ends: 103 [2024-10-11 14:00:49,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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-11 14:00:49,787 INFO L432 NwaCegarLoop]: 146 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, 146 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-11 14:00:49,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:00:49,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-11 14:00:49,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-10-11 14:00:49,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 83 states have (on average 1.3734939759036144) internal successors, (114), 83 states have internal predecessors, (114), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 14:00:49,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 150 transitions. [2024-10-11 14:00:49,820 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 150 transitions. Word has length 135 [2024-10-11 14:00:49,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:00:49,820 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 150 transitions. [2024-10-11 14:00:49,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 14:00:49,822 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 150 transitions. [2024-10-11 14:00:49,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-11 14:00:49,826 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:00:49,826 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:00:49,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 14:00:49,826 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:00:49,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:00:49,827 INFO L85 PathProgramCache]: Analyzing trace with hash 890284280, now seen corresponding path program 1 times [2024-10-11 14:00:49,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:00:49,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211645216] [2024-10-11 14:00:49,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:00:49,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:00:50,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:50,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:00:50,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:50,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:00:50,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:50,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:00:50,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:50,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:00:50,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:50,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:00:50,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:50,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:00:50,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:50,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:00:50,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:50,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:00:50,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:50,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:00:50,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:50,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:00:50,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:50,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:00:50,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:50,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:00:50,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:50,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:00:50,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:50,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:00:50,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:50,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:00:50,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:50,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:00:50,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:50,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:00:50,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:50,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:00:50,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:50,491 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 14:00:50,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:00:50,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211645216] [2024-10-11 14:00:50,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211645216] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:00:50,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:00:50,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:00:50,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903533550] [2024-10-11 14:00:50,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:00:50,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:00:50,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:00:50,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:00:50,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:00:50,494 INFO L87 Difference]: Start difference. First operand 103 states and 150 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 14:00:50,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:00:50,542 INFO L93 Difference]: Finished difference Result 205 states and 299 transitions. [2024-10-11 14:00:50,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:00:50,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 135 [2024-10-11 14:00:50,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:00:50,547 INFO L225 Difference]: With dead ends: 205 [2024-10-11 14:00:50,547 INFO L226 Difference]: Without dead ends: 103 [2024-10-11 14:00:50,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:00:50,549 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:00:50,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 285 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:00:50,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-11 14:00:50,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-10-11 14:00:50,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 83 states have internal predecessors, (113), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 14:00:50,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 149 transitions. [2024-10-11 14:00:50,567 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 149 transitions. Word has length 135 [2024-10-11 14:00:50,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:00:50,570 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 149 transitions. [2024-10-11 14:00:50,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 14:00:50,570 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 149 transitions. [2024-10-11 14:00:50,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-11 14:00:50,574 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:00:50,575 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:00:50,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 14:00:50,575 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:00:50,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:00:50,575 INFO L85 PathProgramCache]: Analyzing trace with hash -389579398, now seen corresponding path program 1 times [2024-10-11 14:00:50,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:00:50,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453789165] [2024-10-11 14:00:50,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:00:50,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:00:50,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:52,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:00:52,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:52,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:00:52,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:52,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:00:52,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:52,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:00:52,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:52,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:00:52,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:52,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:00:52,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:52,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:00:52,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:52,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:00:52,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:52,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:00:52,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:52,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:00:52,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:52,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:00:52,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:52,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:00:52,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:52,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:00:52,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:52,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:00:52,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:52,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:00:52,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:52,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:00:52,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:52,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:00:52,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:52,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:00:52,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:52,213 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 14:00:52,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:00:52,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453789165] [2024-10-11 14:00:52,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453789165] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:00:52,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:00:52,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 14:00:52,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970255302] [2024-10-11 14:00:52,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:00:52,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 14:00:52,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:00:52,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 14:00:52,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-11 14:00:52,216 INFO L87 Difference]: Start difference. First operand 103 states and 149 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 14:00:52,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:00:52,658 INFO L93 Difference]: Finished difference Result 256 states and 371 transitions. [2024-10-11 14:00:52,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:00:52,660 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 135 [2024-10-11 14:00:52,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:00:52,662 INFO L225 Difference]: With dead ends: 256 [2024-10-11 14:00:52,664 INFO L226 Difference]: Without dead ends: 154 [2024-10-11 14:00:52,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-10-11 14:00:52,665 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 468 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 14:00:52,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 334 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 14:00:52,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-10-11 14:00:52,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 121. [2024-10-11 14:00:52,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 101 states have (on average 1.386138613861386) internal successors, (140), 101 states have internal predecessors, (140), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 14:00:52,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 176 transitions. [2024-10-11 14:00:52,692 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 176 transitions. Word has length 135 [2024-10-11 14:00:52,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:00:52,692 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 176 transitions. [2024-10-11 14:00:52,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 14:00:52,693 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 176 transitions. [2024-10-11 14:00:52,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-11 14:00:52,694 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:00:52,694 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:00:52,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 14:00:52,695 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:00:52,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:00:52,696 INFO L85 PathProgramCache]: Analyzing trace with hash -782606408, now seen corresponding path program 1 times [2024-10-11 14:00:52,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:00:52,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222735146] [2024-10-11 14:00:52,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:00:52,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:00:52,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:56,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:00:56,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:56,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:00:56,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:56,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:00:56,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:56,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:00:56,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:56,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:00:56,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:56,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:00:56,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:56,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:00:56,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:56,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:00:56,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:56,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:00:56,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:56,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:00:56,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:56,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:00:56,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:56,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:00:56,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:56,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:00:56,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:56,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:00:56,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:56,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:00:56,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:56,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:00:56,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:56,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:00:56,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:56,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:00:56,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:56,280 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 14:00:56,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:00:56,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222735146] [2024-10-11 14:00:56,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222735146] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:00:56,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:00:56,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 14:00:56,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101174343] [2024-10-11 14:00:56,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:00:56,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 14:00:56,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:00:56,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 14:00:56,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-10-11 14:00:56,285 INFO L87 Difference]: Start difference. First operand 121 states and 176 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-11 14:00:57,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:00:57,227 INFO L93 Difference]: Finished difference Result 344 states and 499 transitions. [2024-10-11 14:00:57,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 14:00:57,228 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 135 [2024-10-11 14:00:57,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:00:57,229 INFO L225 Difference]: With dead ends: 344 [2024-10-11 14:00:57,230 INFO L226 Difference]: Without dead ends: 224 [2024-10-11 14:00:57,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2024-10-11 14:00:57,231 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 154 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 14:00:57,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 651 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 14:00:57,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-10-11 14:00:57,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 219. [2024-10-11 14:00:57,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 180 states have (on average 1.3722222222222222) internal successors, (247), 180 states have internal predecessors, (247), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 14:00:57,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 319 transitions. [2024-10-11 14:00:57,258 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 319 transitions. Word has length 135 [2024-10-11 14:00:57,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:00:57,259 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 319 transitions. [2024-10-11 14:00:57,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-11 14:00:57,259 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 319 transitions. [2024-10-11 14:00:57,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-11 14:00:57,260 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:00:57,261 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:00:57,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 14:00:57,261 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:00:57,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:00:57,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1011019949, now seen corresponding path program 1 times [2024-10-11 14:00:57,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:00:57,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068068791] [2024-10-11 14:00:57,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:00:57,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:00:57,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:58,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:00:58,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:58,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:00:58,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:58,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:00:58,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:58,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:00:58,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:58,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:00:58,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:58,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:00:58,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:58,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:00:58,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:58,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:00:58,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:58,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:00:58,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:58,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:00:58,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:58,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:00:58,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:58,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:00:58,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:58,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:00:58,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:58,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:00:58,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:58,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:00:58,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:58,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:00:58,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:58,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:00:58,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:58,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:00:58,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:58,755 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 14:00:58,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:00:58,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068068791] [2024-10-11 14:00:58,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068068791] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:00:58,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:00:58,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 14:00:58,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51414498] [2024-10-11 14:00:58,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:00:58,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 14:00:58,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:00:58,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 14:00:58,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-11 14:00:58,758 INFO L87 Difference]: Start difference. First operand 219 states and 319 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 14:00:59,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:00:59,039 INFO L93 Difference]: Finished difference Result 341 states and 497 transitions. [2024-10-11 14:00:59,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:00:59,040 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 137 [2024-10-11 14:00:59,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:00:59,042 INFO L225 Difference]: With dead ends: 341 [2024-10-11 14:00:59,042 INFO L226 Difference]: Without dead ends: 221 [2024-10-11 14:00:59,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-10-11 14:00:59,043 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 232 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 14:00:59,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 349 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 14:00:59,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-10-11 14:00:59,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 203. [2024-10-11 14:00:59,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 164 states have (on average 1.353658536585366) internal successors, (222), 164 states have internal predecessors, (222), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 14:00:59,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 294 transitions. [2024-10-11 14:00:59,080 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 294 transitions. Word has length 137 [2024-10-11 14:00:59,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:00:59,081 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 294 transitions. [2024-10-11 14:00:59,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 14:00:59,081 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 294 transitions. [2024-10-11 14:00:59,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-11 14:00:59,082 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:00:59,082 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:00:59,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 14:00:59,082 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:00:59,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:00:59,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1404046959, now seen corresponding path program 1 times [2024-10-11 14:00:59,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:00:59,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943108829] [2024-10-11 14:00:59,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:00:59,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:00:59,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:00,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:00,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:00,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:00,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:00,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:00,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:00,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:00,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:00,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:01:00,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:00,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:01:00,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:00,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:00,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:00,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:00,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:00,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:01:00,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:01,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:01,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:01,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:01,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:01,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:01,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:01,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:01,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:01,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:01,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:01,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:01:01,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:01,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:01:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:01,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:01:01,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:01,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:01:01,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:01,099 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 14:01:01,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:01,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943108829] [2024-10-11 14:01:01,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943108829] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:01,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:01,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 14:01:01,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633636184] [2024-10-11 14:01:01,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:01,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 14:01:01,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:01,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 14:01:01,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-11 14:01:01,104 INFO L87 Difference]: Start difference. First operand 203 states and 294 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 14:01:02,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:02,119 INFO L93 Difference]: Finished difference Result 357 states and 515 transitions. [2024-10-11 14:01:02,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 14:01:02,120 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 137 [2024-10-11 14:01:02,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:02,122 INFO L225 Difference]: With dead ends: 357 [2024-10-11 14:01:02,122 INFO L226 Difference]: Without dead ends: 253 [2024-10-11 14:01:02,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2024-10-11 14:01:02,123 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 285 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:02,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 588 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 14:01:02,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-10-11 14:01:02,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 219. [2024-10-11 14:01:02,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 180 states have (on average 1.3666666666666667) internal successors, (246), 180 states have internal predecessors, (246), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 14:01:02,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 318 transitions. [2024-10-11 14:01:02,151 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 318 transitions. Word has length 137 [2024-10-11 14:01:02,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:02,153 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 318 transitions. [2024-10-11 14:01:02,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 14:01:02,153 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 318 transitions. [2024-10-11 14:01:02,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-11 14:01:02,155 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:02,155 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:01:02,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 14:01:02,157 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:02,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:02,158 INFO L85 PathProgramCache]: Analyzing trace with hash -2128471348, now seen corresponding path program 1 times [2024-10-11 14:01:02,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:02,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122400270] [2024-10-11 14:01:02,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:02,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:02,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:02,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:02,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:02,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:02,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:02,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:02,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:02,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:02,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:02,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:01:02,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:02,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:01:02,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:02,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:02,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:02,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:02,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:02,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:01:02,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:02,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:02,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:02,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:02,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:02,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:02,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:02,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:02,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:02,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:02,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:02,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:01:02,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:02,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:01:02,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:02,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:01:02,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:02,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:01:02,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:02,427 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 14:01:02,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:02,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122400270] [2024-10-11 14:01:02,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122400270] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:02,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:02,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:01:02,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991210232] [2024-10-11 14:01:02,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:02,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:01:02,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:02,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:01:02,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:01:02,430 INFO L87 Difference]: Start difference. First operand 219 states and 318 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 14:01:02,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:02,464 INFO L93 Difference]: Finished difference Result 437 states and 635 transitions. [2024-10-11 14:01:02,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:01:02,465 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2024-10-11 14:01:02,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:02,467 INFO L225 Difference]: With dead ends: 437 [2024-10-11 14:01:02,467 INFO L226 Difference]: Without dead ends: 219 [2024-10-11 14:01:02,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:01:02,468 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:02,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 284 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:01:02,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-11 14:01:02,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2024-10-11 14:01:02,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 180 states have (on average 1.3555555555555556) internal successors, (244), 180 states have internal predecessors, (244), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 14:01:02,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 316 transitions. [2024-10-11 14:01:02,506 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 316 transitions. Word has length 140 [2024-10-11 14:01:02,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:02,506 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 316 transitions. [2024-10-11 14:01:02,507 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 14:01:02,507 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 316 transitions. [2024-10-11 14:01:02,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-11 14:01:02,507 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:02,507 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:01:02,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 14:01:02,508 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:02,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:02,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1870305910, now seen corresponding path program 1 times [2024-10-11 14:01:02,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:02,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041376837] [2024-10-11 14:01:02,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:02,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:02,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:02,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:02,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:02,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:02,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:02,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:02,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:02,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:02,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:02,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:01:02,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:02,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:01:02,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:02,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:02,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:02,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:02,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:02,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:01:02,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:02,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:02,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:03,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:03,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:03,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:03,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:03,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:03,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:03,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:03,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:03,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:01:03,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:03,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:01:03,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:03,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:01:03,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:03,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:01:03,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:03,029 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 14:01:03,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:03,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041376837] [2024-10-11 14:01:03,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041376837] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:03,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:03,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 14:01:03,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124545078] [2024-10-11 14:01:03,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:03,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 14:01:03,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:03,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 14:01:03,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 14:01:03,032 INFO L87 Difference]: Start difference. First operand 219 states and 316 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 14:01:03,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:03,274 INFO L93 Difference]: Finished difference Result 515 states and 736 transitions. [2024-10-11 14:01:03,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 14:01:03,274 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2024-10-11 14:01:03,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:03,276 INFO L225 Difference]: With dead ends: 515 [2024-10-11 14:01:03,276 INFO L226 Difference]: Without dead ends: 297 [2024-10-11 14:01:03,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 14:01:03,277 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 172 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:03,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 561 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 14:01:03,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-10-11 14:01:03,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 245. [2024-10-11 14:01:03,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 206 states have (on average 1.3398058252427185) internal successors, (276), 206 states have internal predecessors, (276), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 14:01:03,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 348 transitions. [2024-10-11 14:01:03,301 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 348 transitions. Word has length 140 [2024-10-11 14:01:03,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:03,301 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 348 transitions. [2024-10-11 14:01:03,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 14:01:03,301 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 348 transitions. [2024-10-11 14:01:03,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 14:01:03,303 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:03,303 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:01:03,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 14:01:03,303 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:03,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:03,303 INFO L85 PathProgramCache]: Analyzing trace with hash -183620742, now seen corresponding path program 1 times [2024-10-11 14:01:03,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:03,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462448060] [2024-10-11 14:01:03,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:03,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:03,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:04,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:04,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:04,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:04,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:01:04,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:01:04,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:04,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:04,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:01:04,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:04,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:04,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:04,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:04,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:01:04,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:01:04,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:01:04,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:01:04,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:04,860 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 14:01:04,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:04,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462448060] [2024-10-11 14:01:04,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462448060] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:04,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:04,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-11 14:01:04,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140544137] [2024-10-11 14:01:04,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:04,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 14:01:04,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:04,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 14:01:04,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-10-11 14:01:04,863 INFO L87 Difference]: Start difference. First operand 245 states and 348 transitions. Second operand has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-11 14:01:06,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:06,018 INFO L93 Difference]: Finished difference Result 633 states and 899 transitions. [2024-10-11 14:01:06,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 14:01:06,018 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 141 [2024-10-11 14:01:06,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:06,020 INFO L225 Difference]: With dead ends: 633 [2024-10-11 14:01:06,020 INFO L226 Difference]: Without dead ends: 389 [2024-10-11 14:01:06,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2024-10-11 14:01:06,021 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 384 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:06,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 749 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 968 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 14:01:06,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-10-11 14:01:06,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 351. [2024-10-11 14:01:06,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 293 states have (on average 1.3378839590443685) internal successors, (392), 293 states have internal predecessors, (392), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-11 14:01:06,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 500 transitions. [2024-10-11 14:01:06,055 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 500 transitions. Word has length 141 [2024-10-11 14:01:06,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:06,055 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 500 transitions. [2024-10-11 14:01:06,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-11 14:01:06,056 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 500 transitions. [2024-10-11 14:01:06,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 14:01:06,056 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:06,057 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:01:06,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 14:01:06,057 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:06,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:06,057 INFO L85 PathProgramCache]: Analyzing trace with hash -576647752, now seen corresponding path program 1 times [2024-10-11 14:01:06,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:06,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570736970] [2024-10-11 14:01:06,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:06,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:06,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:08,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:08,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:08,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:08,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:08,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:08,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:08,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:08,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:08,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:01:08,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:08,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:01:09,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:09,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:09,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:09,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:09,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:09,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:01:09,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:09,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:09,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:09,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:09,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:09,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:09,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:09,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:09,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:09,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:09,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:09,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:01:09,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:09,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:01:09,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:09,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:01:09,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:09,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:01:09,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:09,112 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 14:01:09,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:09,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570736970] [2024-10-11 14:01:09,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570736970] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:09,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:09,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-11 14:01:09,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109743661] [2024-10-11 14:01:09,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:09,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 14:01:09,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:09,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 14:01:09,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2024-10-11 14:01:09,114 INFO L87 Difference]: Start difference. First operand 351 states and 500 transitions. Second operand has 17 states, 15 states have (on average 3.6) internal successors, (54), 17 states have internal predecessors, (54), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 5 states have call successors, (18) [2024-10-11 14:01:10,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:10,295 INFO L93 Difference]: Finished difference Result 738 states and 1048 transitions. [2024-10-11 14:01:10,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 14:01:10,296 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.6) internal successors, (54), 17 states have internal predecessors, (54), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 5 states have call successors, (18) Word has length 141 [2024-10-11 14:01:10,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:10,298 INFO L225 Difference]: With dead ends: 738 [2024-10-11 14:01:10,298 INFO L226 Difference]: Without dead ends: 388 [2024-10-11 14:01:10,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2024-10-11 14:01:10,299 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 220 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 1230 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:10,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 1214 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1230 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 14:01:10,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-10-11 14:01:10,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 351. [2024-10-11 14:01:10,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 293 states have (on average 1.3344709897610922) internal successors, (391), 293 states have internal predecessors, (391), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-11 14:01:10,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 499 transitions. [2024-10-11 14:01:10,335 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 499 transitions. Word has length 141 [2024-10-11 14:01:10,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:10,336 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 499 transitions. [2024-10-11 14:01:10,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.6) internal successors, (54), 17 states have internal predecessors, (54), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 5 states have call successors, (18) [2024-10-11 14:01:10,337 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 499 transitions. [2024-10-11 14:01:10,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 14:01:10,337 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:10,338 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:01:10,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 14:01:10,338 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:10,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:10,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1872564484, now seen corresponding path program 1 times [2024-10-11 14:01:10,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:10,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950893600] [2024-10-11 14:01:10,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:10,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:10,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:11,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:11,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:11,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:11,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:01:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:01:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:11,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:11,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:01:11,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:11,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:11,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:11,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:11,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:11,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:01:11,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:01:11,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:01:11,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:01:11,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:11,840 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 14:01:11,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:11,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950893600] [2024-10-11 14:01:11,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950893600] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:11,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:11,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 14:01:11,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833299953] [2024-10-11 14:01:11,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:11,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 14:01:11,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:11,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 14:01:11,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-10-11 14:01:11,842 INFO L87 Difference]: Start difference. First operand 351 states and 499 transitions. Second operand has 11 states, 10 states have (on average 5.4) internal successors, (54), 11 states have internal predecessors, (54), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-10-11 14:01:12,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:12,321 INFO L93 Difference]: Finished difference Result 816 states and 1162 transitions. [2024-10-11 14:01:12,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 14:01:12,321 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.4) internal successors, (54), 11 states have internal predecessors, (54), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 141 [2024-10-11 14:01:12,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:12,325 INFO L225 Difference]: With dead ends: 816 [2024-10-11 14:01:12,326 INFO L226 Difference]: Without dead ends: 466 [2024-10-11 14:01:12,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2024-10-11 14:01:12,327 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 273 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:12,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 426 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 14:01:12,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2024-10-11 14:01:12,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 378. [2024-10-11 14:01:12,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 320 states have (on average 1.3375) internal successors, (428), 320 states have internal predecessors, (428), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-11 14:01:12,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 536 transitions. [2024-10-11 14:01:12,381 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 536 transitions. Word has length 141 [2024-10-11 14:01:12,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:12,383 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 536 transitions. [2024-10-11 14:01:12,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.4) internal successors, (54), 11 states have internal predecessors, (54), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-10-11 14:01:12,383 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 536 transitions. [2024-10-11 14:01:12,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 14:01:12,385 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:12,385 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:01:12,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 14:01:12,385 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:12,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:12,385 INFO L85 PathProgramCache]: Analyzing trace with hash 2029375802, now seen corresponding path program 1 times [2024-10-11 14:01:12,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:12,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650900902] [2024-10-11 14:01:12,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:12,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:12,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:14,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:14,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:14,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:14,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:14,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:14,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:14,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:14,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:14,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:01:14,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:14,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:01:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:14,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:14,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:14,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:14,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:14,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:01:14,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:14,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:14,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:14,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:14,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:14,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:14,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:14,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:14,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:14,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:14,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:14,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:01:14,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:14,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:01:14,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:14,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:01:14,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:14,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:01:14,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:14,388 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 14:01:14,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:14,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650900902] [2024-10-11 14:01:14,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650900902] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:14,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:14,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-11 14:01:14,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080326029] [2024-10-11 14:01:14,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:14,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 14:01:14,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:14,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 14:01:14,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-10-11 14:01:14,390 INFO L87 Difference]: Start difference. First operand 378 states and 536 transitions. Second operand has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-11 14:01:15,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:15,532 INFO L93 Difference]: Finished difference Result 792 states and 1120 transitions. [2024-10-11 14:01:15,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 14:01:15,533 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 141 [2024-10-11 14:01:15,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:15,535 INFO L225 Difference]: With dead ends: 792 [2024-10-11 14:01:15,535 INFO L226 Difference]: Without dead ends: 415 [2024-10-11 14:01:15,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2024-10-11 14:01:15,536 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 224 mSDsluCounter, 1043 mSDsCounter, 0 mSdLazyCounter, 1350 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 1379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:15,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 1197 Invalid, 1379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1350 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 14:01:15,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2024-10-11 14:01:15,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 377. [2024-10-11 14:01:15,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 319 states have (on average 1.335423197492163) internal successors, (426), 319 states have internal predecessors, (426), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-11 14:01:15,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 534 transitions. [2024-10-11 14:01:15,574 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 534 transitions. Word has length 141 [2024-10-11 14:01:15,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:15,574 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 534 transitions. [2024-10-11 14:01:15,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-11 14:01:15,575 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 534 transitions. [2024-10-11 14:01:15,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 14:01:15,576 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:15,576 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:01:15,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 14:01:15,576 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:15,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:15,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1649477960, now seen corresponding path program 1 times [2024-10-11 14:01:15,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:15,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818820693] [2024-10-11 14:01:15,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:15,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:15,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:15,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:15,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:15,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:15,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:15,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:15,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:15,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:15,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:15,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:01:15,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:15,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:01:15,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:15,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:15,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:15,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:15,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:15,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:01:15,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:15,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:15,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:15,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:15,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:15,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:15,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:15,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:15,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:15,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:15,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:15,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:01:15,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:15,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:01:15,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:15,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:01:15,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:15,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:01:15,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:15,743 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 14:01:15,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:15,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818820693] [2024-10-11 14:01:15,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818820693] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:15,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:15,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:01:15,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168304057] [2024-10-11 14:01:15,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:15,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:01:15,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:15,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:01:15,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:01:15,745 INFO L87 Difference]: Start difference. First operand 377 states and 534 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 14:01:15,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:15,903 INFO L93 Difference]: Finished difference Result 762 states and 1079 transitions. [2024-10-11 14:01:15,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:01:15,907 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 142 [2024-10-11 14:01:15,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:15,910 INFO L225 Difference]: With dead ends: 762 [2024-10-11 14:01:15,910 INFO L226 Difference]: Without dead ends: 386 [2024-10-11 14:01:15,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 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-11 14:01:15,916 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 554 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-11 14:01:15,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 554 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:01:15,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2024-10-11 14:01:16,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2024-10-11 14:01:16,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 328 states have (on average 1.326219512195122) internal successors, (435), 328 states have internal predecessors, (435), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-11 14:01:16,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 543 transitions. [2024-10-11 14:01:16,014 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 543 transitions. Word has length 142 [2024-10-11 14:01:16,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:16,014 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 543 transitions. [2024-10-11 14:01:16,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 14:01:16,019 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 543 transitions. [2024-10-11 14:01:16,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 14:01:16,020 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:16,021 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:01:16,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 14:01:16,021 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:16,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:16,021 INFO L85 PathProgramCache]: Analyzing trace with hash -506862674, now seen corresponding path program 1 times [2024-10-11 14:01:16,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:16,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488480273] [2024-10-11 14:01:16,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:16,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:16,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:16,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:16,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:16,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:16,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:16,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:16,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:16,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:16,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:16,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:01:16,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:16,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:01:16,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:16,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:16,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:16,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:16,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:16,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:01:16,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:16,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:16,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:16,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:16,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:16,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:16,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:16,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:16,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:16,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:16,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:16,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:01:16,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:16,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:01:16,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:16,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:01:16,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:16,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:01:16,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:16,219 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 14:01:16,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:16,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488480273] [2024-10-11 14:01:16,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488480273] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:16,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:16,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 14:01:16,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809832042] [2024-10-11 14:01:16,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:16,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:01:16,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:16,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:01:16,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:01:16,226 INFO L87 Difference]: Start difference. First operand 386 states and 543 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 14:01:16,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:16,322 INFO L93 Difference]: Finished difference Result 783 states and 1100 transitions. [2024-10-11 14:01:16,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:01:16,322 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 142 [2024-10-11 14:01:16,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:16,324 INFO L225 Difference]: With dead ends: 783 [2024-10-11 14:01:16,324 INFO L226 Difference]: Without dead ends: 398 [2024-10-11 14:01:16,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:01:16,326 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:16,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 697 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:01:16,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-10-11 14:01:16,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 392. [2024-10-11 14:01:16,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 334 states have (on average 1.3203592814371257) internal successors, (441), 334 states have internal predecessors, (441), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-11 14:01:16,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 549 transitions. [2024-10-11 14:01:16,405 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 549 transitions. Word has length 142 [2024-10-11 14:01:16,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:16,410 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 549 transitions. [2024-10-11 14:01:16,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 14:01:16,410 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 549 transitions. [2024-10-11 14:01:16,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-11 14:01:16,411 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:16,411 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:01:16,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 14:01:16,411 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:16,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:16,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1580283665, now seen corresponding path program 1 times [2024-10-11 14:01:16,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:16,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814212409] [2024-10-11 14:01:16,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:16,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:16,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:18,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:18,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:18,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:18,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:18,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:18,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:18,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:18,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:18,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:01:18,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:18,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:01:18,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:18,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:18,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:18,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:18,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:18,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:01:18,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:18,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:18,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:18,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:18,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:18,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:18,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:18,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:18,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:18,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:18,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:18,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:01:18,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:18,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:01:18,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:18,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:01:18,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:18,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:01:18,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:18,376 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 14:01:18,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:18,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814212409] [2024-10-11 14:01:18,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814212409] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:18,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:18,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-11 14:01:18,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676439330] [2024-10-11 14:01:18,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:18,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 14:01:18,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:18,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 14:01:18,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2024-10-11 14:01:18,378 INFO L87 Difference]: Start difference. First operand 392 states and 549 transitions. Second operand has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-11 14:01:19,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:19,517 INFO L93 Difference]: Finished difference Result 721 states and 1004 transitions. [2024-10-11 14:01:19,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 14:01:19,517 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 143 [2024-10-11 14:01:19,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:19,519 INFO L225 Difference]: With dead ends: 721 [2024-10-11 14:01:19,519 INFO L226 Difference]: Without dead ends: 442 [2024-10-11 14:01:19,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2024-10-11 14:01:19,520 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 562 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 1109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:19,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 741 Invalid, 1109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 991 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 14:01:19,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2024-10-11 14:01:19,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 401. [2024-10-11 14:01:19,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 343 states have (on average 1.3177842565597668) internal successors, (452), 343 states have internal predecessors, (452), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-11 14:01:19,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 560 transitions. [2024-10-11 14:01:19,588 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 560 transitions. Word has length 143 [2024-10-11 14:01:19,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:19,589 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 560 transitions. [2024-10-11 14:01:19,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-11 14:01:19,589 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 560 transitions. [2024-10-11 14:01:19,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-11 14:01:19,590 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:19,590 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:01:19,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 14:01:19,591 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:19,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:19,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1187256655, now seen corresponding path program 1 times [2024-10-11 14:01:19,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:19,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091454258] [2024-10-11 14:01:19,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:19,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:19,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:22,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:22,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:22,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:22,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:22,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:22,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:23,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:01:23,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:01:23,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:23,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:23,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:01:23,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:23,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:23,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:23,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:23,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:23,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:01:23,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:01:23,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:01:23,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:01:23,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:23,171 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 14:01:23,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:23,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091454258] [2024-10-11 14:01:23,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091454258] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:23,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:23,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-10-11 14:01:23,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160087166] [2024-10-11 14:01:23,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:23,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 14:01:23,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:23,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 14:01:23,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2024-10-11 14:01:23,175 INFO L87 Difference]: Start difference. First operand 401 states and 560 transitions. Second operand has 19 states, 18 states have (on average 3.111111111111111) internal successors, (56), 19 states have internal predecessors, (56), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-10-11 14:01:25,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:25,663 INFO L93 Difference]: Finished difference Result 771 states and 1066 transitions. [2024-10-11 14:01:25,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 14:01:25,664 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.111111111111111) internal successors, (56), 19 states have internal predecessors, (56), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 143 [2024-10-11 14:01:25,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:25,666 INFO L225 Difference]: With dead ends: 771 [2024-10-11 14:01:25,666 INFO L226 Difference]: Without dead ends: 483 [2024-10-11 14:01:25,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=186, Invalid=744, Unknown=0, NotChecked=0, Total=930 [2024-10-11 14:01:25,667 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 466 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 1701 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 1315 SdHoareTripleChecker+Invalid, 1769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:25,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 1315 Invalid, 1769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1701 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 14:01:25,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2024-10-11 14:01:25,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 401. [2024-10-11 14:01:25,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 343 states have (on average 1.3177842565597668) internal successors, (452), 343 states have internal predecessors, (452), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-11 14:01:25,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 560 transitions. [2024-10-11 14:01:25,707 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 560 transitions. Word has length 143 [2024-10-11 14:01:25,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:25,709 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 560 transitions. [2024-10-11 14:01:25,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.111111111111111) internal successors, (56), 19 states have internal predecessors, (56), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-10-11 14:01:25,710 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 560 transitions. [2024-10-11 14:01:25,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-11 14:01:25,710 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:25,710 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:01:25,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 14:01:25,711 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:25,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:25,711 INFO L85 PathProgramCache]: Analyzing trace with hash 2002985491, now seen corresponding path program 1 times [2024-10-11 14:01:25,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:25,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823133005] [2024-10-11 14:01:25,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:25,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:25,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:26,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:26,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:26,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:26,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:01:26,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:01:26,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:26,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:26,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:01:26,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:26,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:26,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:26,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:26,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:01:26,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:01:26,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:01:26,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:01:26,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:26,167 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 14:01:26,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:26,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823133005] [2024-10-11 14:01:26,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823133005] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:26,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:26,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 14:01:26,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162614230] [2024-10-11 14:01:26,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:26,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 14:01:26,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:26,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 14:01:26,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 14:01:26,169 INFO L87 Difference]: Start difference. First operand 401 states and 560 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 14:01:26,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:26,525 INFO L93 Difference]: Finished difference Result 836 states and 1157 transitions. [2024-10-11 14:01:26,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:01:26,526 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), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 143 [2024-10-11 14:01:26,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:26,528 INFO L225 Difference]: With dead ends: 836 [2024-10-11 14:01:26,528 INFO L226 Difference]: Without dead ends: 548 [2024-10-11 14:01:26,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 14:01:26,529 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 211 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:26,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 377 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 14:01:26,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2024-10-11 14:01:26,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 427. [2024-10-11 14:01:26,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 369 states have (on average 1.3143631436314362) internal successors, (485), 369 states have internal predecessors, (485), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-11 14:01:26,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 593 transitions. [2024-10-11 14:01:26,571 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 593 transitions. Word has length 143 [2024-10-11 14:01:26,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:26,572 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 593 transitions. [2024-10-11 14:01:26,572 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), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 14:01:26,572 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 593 transitions. [2024-10-11 14:01:26,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-11 14:01:26,573 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:26,573 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:01:26,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 14:01:26,573 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:26,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:26,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1609958481, now seen corresponding path program 1 times [2024-10-11 14:01:26,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:26,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505808377] [2024-10-11 14:01:26,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:26,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:26,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:28,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:28,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:28,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:28,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:28,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:28,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:28,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:28,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:28,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:01:28,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:28,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:01:28,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:28,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:28,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:28,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:28,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:28,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:01:28,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:28,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:28,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:28,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:28,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:28,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:28,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:28,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:28,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:28,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:28,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:28,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:01:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:28,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:01:28,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:28,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:01:28,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:28,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:01:28,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:28,441 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 14:01:28,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:28,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505808377] [2024-10-11 14:01:28,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505808377] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:28,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:28,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-11 14:01:28,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396424839] [2024-10-11 14:01:28,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:28,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 14:01:28,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:28,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 14:01:28,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2024-10-11 14:01:28,443 INFO L87 Difference]: Start difference. First operand 427 states and 593 transitions. Second operand has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-11 14:01:29,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:29,596 INFO L93 Difference]: Finished difference Result 790 states and 1088 transitions. [2024-10-11 14:01:29,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 14:01:29,597 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 143 [2024-10-11 14:01:29,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:29,602 INFO L225 Difference]: With dead ends: 790 [2024-10-11 14:01:29,602 INFO L226 Difference]: Without dead ends: 476 [2024-10-11 14:01:29,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2024-10-11 14:01:29,604 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 229 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 1258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:29,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 1059 Invalid, 1258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1224 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 14:01:29,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2024-10-11 14:01:29,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 434. [2024-10-11 14:01:29,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 376 states have (on average 1.3085106382978724) internal successors, (492), 376 states have internal predecessors, (492), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-11 14:01:29,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 600 transitions. [2024-10-11 14:01:29,642 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 600 transitions. Word has length 143 [2024-10-11 14:01:29,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:29,642 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 600 transitions. [2024-10-11 14:01:29,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 16 states have internal predecessors, (56), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-11 14:01:29,642 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 600 transitions. [2024-10-11 14:01:29,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-11 14:01:29,643 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:29,643 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:01:29,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 14:01:29,644 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:29,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:29,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1123759763, now seen corresponding path program 1 times [2024-10-11 14:01:29,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:29,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286556586] [2024-10-11 14:01:29,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:29,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:29,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:30,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:30,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:30,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:30,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:01:30,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:01:30,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:30,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:30,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:01:30,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:30,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:30,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:30,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:30,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:30,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:01:30,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:01:30,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:01:30,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:01:30,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,029 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 14:01:30,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:30,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286556586] [2024-10-11 14:01:30,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286556586] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:30,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:30,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 14:01:30,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760473936] [2024-10-11 14:01:30,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:30,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 14:01:30,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:30,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 14:01:30,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 14:01:30,031 INFO L87 Difference]: Start difference. First operand 434 states and 600 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 14:01:30,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:30,413 INFO L93 Difference]: Finished difference Result 876 states and 1202 transitions. [2024-10-11 14:01:30,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 14:01:30,414 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 143 [2024-10-11 14:01:30,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:30,416 INFO L225 Difference]: With dead ends: 876 [2024-10-11 14:01:30,416 INFO L226 Difference]: Without dead ends: 555 [2024-10-11 14:01:30,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-11 14:01:30,417 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 52 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:30,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 926 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 14:01:30,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2024-10-11 14:01:30,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 453. [2024-10-11 14:01:30,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 395 states have (on average 1.3037974683544304) internal successors, (515), 395 states have internal predecessors, (515), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-11 14:01:30,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 623 transitions. [2024-10-11 14:01:30,456 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 623 transitions. Word has length 143 [2024-10-11 14:01:30,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:30,456 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 623 transitions. [2024-10-11 14:01:30,457 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 14:01:30,457 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 623 transitions. [2024-10-11 14:01:30,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-11 14:01:30,457 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:30,457 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:01:30,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 14:01:30,458 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:30,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:30,458 INFO L85 PathProgramCache]: Analyzing trace with hash 730732753, now seen corresponding path program 1 times [2024-10-11 14:01:30,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:30,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017817334] [2024-10-11 14:01:30,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:30,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:30,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:30,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:30,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:30,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:30,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:01:30,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:01:30,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:30,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:30,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:01:30,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:30,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:30,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:30,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:30,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:30,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:01:30,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:01:30,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:01:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:01:30,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:30,773 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 14:01:30,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:30,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017817334] [2024-10-11 14:01:30,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017817334] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:30,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:30,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 14:01:30,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839428316] [2024-10-11 14:01:30,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:30,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 14:01:30,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:30,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 14:01:30,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 14:01:30,775 INFO L87 Difference]: Start difference. First operand 453 states and 623 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 14:01:31,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:31,217 INFO L93 Difference]: Finished difference Result 895 states and 1223 transitions. [2024-10-11 14:01:31,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 14:01:31,217 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 143 [2024-10-11 14:01:31,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:31,220 INFO L225 Difference]: With dead ends: 895 [2024-10-11 14:01:31,220 INFO L226 Difference]: Without dead ends: 555 [2024-10-11 14:01:31,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-11 14:01:31,221 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 51 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:31,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 747 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 14:01:31,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2024-10-11 14:01:31,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 446. [2024-10-11 14:01:31,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 388 states have (on average 1.306701030927835) internal successors, (507), 388 states have internal predecessors, (507), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-11 14:01:31,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 615 transitions. [2024-10-11 14:01:31,259 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 615 transitions. Word has length 143 [2024-10-11 14:01:31,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:31,260 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 615 transitions. [2024-10-11 14:01:31,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 14:01:31,260 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 615 transitions. [2024-10-11 14:01:31,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-11 14:01:31,261 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:31,261 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:01:31,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 14:01:31,261 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:31,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:31,261 INFO L85 PathProgramCache]: Analyzing trace with hash -958210989, now seen corresponding path program 1 times [2024-10-11 14:01:31,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:31,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338926292] [2024-10-11 14:01:31,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:31,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:31,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:33,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:33,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:33,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:33,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:33,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:33,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:33,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:33,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:33,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:01:33,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:33,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:01:33,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:33,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:33,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:33,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:33,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:33,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:01:33,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:33,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:33,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:33,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:33,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:33,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:33,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:33,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:33,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:33,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:33,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:33,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:01:33,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:33,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:01:33,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:33,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:01:33,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:33,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:01:33,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:33,313 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 14:01:33,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:33,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338926292] [2024-10-11 14:01:33,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338926292] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:33,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:33,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-10-11 14:01:33,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462173390] [2024-10-11 14:01:33,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:33,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 14:01:33,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:33,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 14:01:33,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2024-10-11 14:01:33,321 INFO L87 Difference]: Start difference. First operand 446 states and 615 transitions. Second operand has 19 states, 18 states have (on average 3.111111111111111) internal successors, (56), 19 states have internal predecessors, (56), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-10-11 14:01:37,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:37,312 INFO L93 Difference]: Finished difference Result 729 states and 994 transitions. [2024-10-11 14:01:37,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 14:01:37,313 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.111111111111111) internal successors, (56), 19 states have internal predecessors, (56), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 143 [2024-10-11 14:01:37,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:37,315 INFO L225 Difference]: With dead ends: 729 [2024-10-11 14:01:37,315 INFO L226 Difference]: Without dead ends: 544 [2024-10-11 14:01:37,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=185, Invalid=745, Unknown=0, NotChecked=0, Total=930 [2024-10-11 14:01:37,316 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 400 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 1905 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 1326 SdHoareTripleChecker+Invalid, 1936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:37,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 1326 Invalid, 1936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1905 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 14:01:37,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2024-10-11 14:01:37,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 453. [2024-10-11 14:01:37,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 395 states have (on average 1.3012658227848102) internal successors, (514), 395 states have internal predecessors, (514), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-11 14:01:37,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 622 transitions. [2024-10-11 14:01:37,357 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 622 transitions. Word has length 143 [2024-10-11 14:01:37,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:37,357 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 622 transitions. [2024-10-11 14:01:37,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.111111111111111) internal successors, (56), 19 states have internal predecessors, (56), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-10-11 14:01:37,358 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 622 transitions. [2024-10-11 14:01:37,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-11 14:01:37,358 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:37,359 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:01:37,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 14:01:37,359 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:37,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:37,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1968199569, now seen corresponding path program 1 times [2024-10-11 14:01:37,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:37,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861804277] [2024-10-11 14:01:37,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:37,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:37,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:39,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:39,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:39,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:39,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:39,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:39,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:39,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:39,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:39,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:01:39,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:39,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:01:39,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:39,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:39,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:39,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:39,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:39,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:01:39,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:39,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:39,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:39,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:39,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:39,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:39,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:39,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:39,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:39,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:39,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:39,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:01:39,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:39,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:01:39,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:39,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:01:39,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:39,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:01:39,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:39,886 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 14:01:39,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:39,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861804277] [2024-10-11 14:01:39,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861804277] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:39,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:39,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-11 14:01:39,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542931924] [2024-10-11 14:01:39,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:39,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 14:01:39,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:39,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 14:01:39,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-10-11 14:01:39,888 INFO L87 Difference]: Start difference. First operand 453 states and 622 transitions. Second operand has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 14 states have internal predecessors, (57), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-10-11 14:01:40,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:40,662 INFO L93 Difference]: Finished difference Result 959 states and 1311 transitions. [2024-10-11 14:01:40,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 14:01:40,663 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 14 states have internal predecessors, (57), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 144 [2024-10-11 14:01:40,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:40,669 INFO L225 Difference]: With dead ends: 959 [2024-10-11 14:01:40,669 INFO L226 Difference]: Without dead ends: 507 [2024-10-11 14:01:40,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2024-10-11 14:01:40,670 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 442 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:40,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 375 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 14:01:40,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2024-10-11 14:01:40,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 491. [2024-10-11 14:01:40,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 433 states have (on average 1.2933025404157044) internal successors, (560), 433 states have internal predecessors, (560), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-11 14:01:40,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 668 transitions. [2024-10-11 14:01:40,727 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 668 transitions. Word has length 144 [2024-10-11 14:01:40,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:40,727 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 668 transitions. [2024-10-11 14:01:40,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 14 states have internal predecessors, (57), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-10-11 14:01:40,727 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 668 transitions. [2024-10-11 14:01:40,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-11 14:01:40,728 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:40,728 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:01:40,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 14:01:40,728 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:40,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:40,729 INFO L85 PathProgramCache]: Analyzing trace with hash -831080835, now seen corresponding path program 1 times [2024-10-11 14:01:40,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:40,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744735657] [2024-10-11 14:01:40,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:40,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:40,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:42,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:42,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:42,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:42,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:42,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:42,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:42,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:42,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:42,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:01:42,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:42,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:01:42,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:42,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:42,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:42,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:42,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:42,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:01:42,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:42,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:42,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:42,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:42,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:42,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:42,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:42,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:42,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:42,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:42,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:42,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:01:42,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:42,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:01:42,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:42,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:01:42,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:42,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:01:42,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:42,498 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 14:01:42,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:42,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744735657] [2024-10-11 14:01:42,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744735657] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:42,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:42,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-11 14:01:42,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282163320] [2024-10-11 14:01:42,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:42,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 14:01:42,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:42,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 14:01:42,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-10-11 14:01:42,500 INFO L87 Difference]: Start difference. First operand 491 states and 668 transitions. Second operand has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 14 states have internal predecessors, (57), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-10-11 14:01:43,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:43,477 INFO L93 Difference]: Finished difference Result 906 states and 1207 transitions. [2024-10-11 14:01:43,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 14:01:43,477 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 14 states have internal predecessors, (57), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 144 [2024-10-11 14:01:43,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:43,480 INFO L225 Difference]: With dead ends: 906 [2024-10-11 14:01:43,480 INFO L226 Difference]: Without dead ends: 904 [2024-10-11 14:01:43,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2024-10-11 14:01:43,480 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 464 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:43,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 525 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 14:01:43,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2024-10-11 14:01:43,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 796. [2024-10-11 14:01:43,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 738 states have (on average 1.2967479674796747) internal successors, (957), 738 states have internal predecessors, (957), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-11 14:01:43,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1065 transitions. [2024-10-11 14:01:43,540 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1065 transitions. Word has length 144 [2024-10-11 14:01:43,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:43,541 INFO L471 AbstractCegarLoop]: Abstraction has 796 states and 1065 transitions. [2024-10-11 14:01:43,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 14 states have internal predecessors, (57), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-10-11 14:01:43,541 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1065 transitions. [2024-10-11 14:01:43,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-11 14:01:43,542 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:43,542 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:01:43,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 14:01:43,542 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:43,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:43,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1338993955, now seen corresponding path program 1 times [2024-10-11 14:01:43,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:43,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010045721] [2024-10-11 14:01:43,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:43,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:43,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:43,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:43,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:43,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:43,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:43,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:43,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:43,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:43,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:43,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:01:43,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:43,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:01:43,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:43,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:43,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:43,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:43,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:43,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:01:43,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:43,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:43,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:43,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:43,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:43,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:43,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:43,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:43,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:43,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:43,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:43,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:01:43,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:43,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:01:43,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:43,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:01:43,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:43,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:01:43,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:43,672 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 14:01:43,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:43,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010045721] [2024-10-11 14:01:43,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010045721] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:43,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:43,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 14:01:43,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358146109] [2024-10-11 14:01:43,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:43,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 14:01:43,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:43,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 14:01:43,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 14:01:43,674 INFO L87 Difference]: Start difference. First operand 796 states and 1065 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 14:01:43,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:43,771 INFO L93 Difference]: Finished difference Result 1649 states and 2195 transitions. [2024-10-11 14:01:43,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 14:01:43,772 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2024-10-11 14:01:43,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:43,775 INFO L225 Difference]: With dead ends: 1649 [2024-10-11 14:01:43,775 INFO L226 Difference]: Without dead ends: 854 [2024-10-11 14:01:43,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 14:01:43,777 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:43,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 832 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:01:43,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2024-10-11 14:01:43,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 804. [2024-10-11 14:01:43,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 746 states have (on average 1.2935656836461127) internal successors, (965), 746 states have internal predecessors, (965), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-11 14:01:43,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1073 transitions. [2024-10-11 14:01:43,839 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1073 transitions. Word has length 144 [2024-10-11 14:01:43,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:43,840 INFO L471 AbstractCegarLoop]: Abstraction has 804 states and 1073 transitions. [2024-10-11 14:01:43,840 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 14:01:43,840 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1073 transitions. [2024-10-11 14:01:43,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-11 14:01:43,841 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:43,841 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:01:43,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 14:01:43,841 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:43,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:43,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1462509908, now seen corresponding path program 1 times [2024-10-11 14:01:43,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:43,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762526513] [2024-10-11 14:01:43,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:43,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:43,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:46,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:46,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:46,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:46,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:46,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:46,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:46,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:46,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:46,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:01:46,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:46,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:01:46,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:46,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:46,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:46,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:46,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:46,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:01:46,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:46,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:46,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:46,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:46,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:46,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:46,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:46,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:46,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:46,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:46,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:46,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:01:46,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:46,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:01:46,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:46,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:01:46,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:46,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:01:46,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:46,910 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 14:01:46,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:46,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762526513] [2024-10-11 14:01:46,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762526513] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:46,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:46,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-11 14:01:46,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590666437] [2024-10-11 14:01:46,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:46,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 14:01:46,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:46,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 14:01:46,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-10-11 14:01:46,912 INFO L87 Difference]: Start difference. First operand 804 states and 1073 transitions. Second operand has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-11 14:01:48,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:48,486 INFO L93 Difference]: Finished difference Result 1574 states and 2090 transitions. [2024-10-11 14:01:48,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 14:01:48,487 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 145 [2024-10-11 14:01:48,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:48,489 INFO L225 Difference]: With dead ends: 1574 [2024-10-11 14:01:48,489 INFO L226 Difference]: Without dead ends: 932 [2024-10-11 14:01:48,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2024-10-11 14:01:48,513 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 371 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 1089 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 1163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:48,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 799 Invalid, 1163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1089 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 14:01:48,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2024-10-11 14:01:48,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 804. [2024-10-11 14:01:48,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 746 states have (on average 1.2935656836461127) internal successors, (965), 746 states have internal predecessors, (965), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-11 14:01:48,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1073 transitions. [2024-10-11 14:01:48,579 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1073 transitions. Word has length 145 [2024-10-11 14:01:48,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:48,579 INFO L471 AbstractCegarLoop]: Abstraction has 804 states and 1073 transitions. [2024-10-11 14:01:48,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-11 14:01:48,579 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1073 transitions. [2024-10-11 14:01:48,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-11 14:01:48,581 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:48,581 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:01:48,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 14:01:48,581 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:48,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:48,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1855536918, now seen corresponding path program 1 times [2024-10-11 14:01:48,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:48,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132591492] [2024-10-11 14:01:48,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:48,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:48,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:49,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:49,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:49,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:49,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:49,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:49,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:49,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:49,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:49,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:01:49,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:49,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:01:49,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:49,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:49,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:49,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:49,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:49,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:01:49,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:49,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:49,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:49,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:49,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:49,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:49,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:49,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:49,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:49,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:49,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:49,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:01:49,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:49,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:01:49,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:49,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:01:49,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:49,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:01:49,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:49,038 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 14:01:49,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:49,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132591492] [2024-10-11 14:01:49,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132591492] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:49,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:49,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 14:01:49,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221815474] [2024-10-11 14:01:49,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:49,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 14:01:49,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:49,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 14:01:49,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 14:01:49,041 INFO L87 Difference]: Start difference. First operand 804 states and 1073 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 14:01:49,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:49,405 INFO L93 Difference]: Finished difference Result 1672 states and 2223 transitions. [2024-10-11 14:01:49,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:01:49,406 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2024-10-11 14:01:49,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:49,409 INFO L225 Difference]: With dead ends: 1672 [2024-10-11 14:01:49,409 INFO L226 Difference]: Without dead ends: 1030 [2024-10-11 14:01:49,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 14:01:49,411 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 145 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:49,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 398 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 14:01:49,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2024-10-11 14:01:49,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 790. [2024-10-11 14:01:49,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 790 states, 732 states have (on average 1.2745901639344261) internal successors, (933), 732 states have internal predecessors, (933), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-11 14:01:49,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1041 transitions. [2024-10-11 14:01:49,471 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1041 transitions. Word has length 145 [2024-10-11 14:01:49,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:49,471 INFO L471 AbstractCegarLoop]: Abstraction has 790 states and 1041 transitions. [2024-10-11 14:01:49,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 14:01:49,471 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1041 transitions. [2024-10-11 14:01:49,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-11 14:01:49,472 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:49,472 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:01:49,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 14:01:49,473 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:49,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:49,473 INFO L85 PathProgramCache]: Analyzing trace with hash 633992044, now seen corresponding path program 1 times [2024-10-11 14:01:49,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:49,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993647349] [2024-10-11 14:01:49,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:49,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:49,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:51,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:51,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:51,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:51,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:51,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:51,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:51,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:51,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:51,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:01:51,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:51,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:01:51,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:51,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:51,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:51,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:51,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:51,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:01:51,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:51,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:51,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:51,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:51,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:51,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:51,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:51,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:51,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:51,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:51,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:51,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:01:51,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:51,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:01:51,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:51,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:01:51,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:51,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:01:51,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:51,374 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 14:01:51,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:51,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993647349] [2024-10-11 14:01:51,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993647349] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:51,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:51,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-11 14:01:51,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811694706] [2024-10-11 14:01:51,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:51,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 14:01:51,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:51,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 14:01:51,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-10-11 14:01:51,376 INFO L87 Difference]: Start difference. First operand 790 states and 1041 transitions. Second operand has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-11 14:01:52,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:52,537 INFO L93 Difference]: Finished difference Result 1540 states and 2016 transitions. [2024-10-11 14:01:52,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 14:01:52,537 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 145 [2024-10-11 14:01:52,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:52,540 INFO L225 Difference]: With dead ends: 1540 [2024-10-11 14:01:52,540 INFO L226 Difference]: Without dead ends: 912 [2024-10-11 14:01:52,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2024-10-11 14:01:52,542 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 251 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 1119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:52,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 929 Invalid, 1119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 14:01:52,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2024-10-11 14:01:52,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 613. [2024-10-11 14:01:52,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 574 states have (on average 1.278745644599303) internal successors, (734), 574 states have internal predecessors, (734), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 14:01:52,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 806 transitions. [2024-10-11 14:01:52,584 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 806 transitions. Word has length 145 [2024-10-11 14:01:52,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:52,585 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 806 transitions. [2024-10-11 14:01:52,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-11 14:01:52,585 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 806 transitions. [2024-10-11 14:01:52,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-11 14:01:52,586 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:52,586 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:01:52,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 14:01:52,586 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:52,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:52,587 INFO L85 PathProgramCache]: Analyzing trace with hash -452468758, now seen corresponding path program 1 times [2024-10-11 14:01:52,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:52,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092272826] [2024-10-11 14:01:52,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:52,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:52,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:53,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:53,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:53,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:53,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:53,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:53,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:53,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:53,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:53,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:01:53,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:53,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:01:53,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:53,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:53,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:53,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:53,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:53,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:01:53,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:53,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:53,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:53,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:53,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:53,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:53,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:53,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:53,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:53,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:53,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:01:53,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:53,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:01:53,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:53,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:01:53,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:53,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:01:53,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:53,648 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 14:01:53,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:53,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092272826] [2024-10-11 14:01:53,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092272826] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:53,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:53,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-11 14:01:53,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251675712] [2024-10-11 14:01:53,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:53,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 14:01:53,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:53,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 14:01:53,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-10-11 14:01:53,650 INFO L87 Difference]: Start difference. First operand 613 states and 806 transitions. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 14:01:54,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:54,751 INFO L93 Difference]: Finished difference Result 1127 states and 1471 transitions. [2024-10-11 14:01:54,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 14:01:54,752 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2024-10-11 14:01:54,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:54,754 INFO L225 Difference]: With dead ends: 1127 [2024-10-11 14:01:54,754 INFO L226 Difference]: Without dead ends: 718 [2024-10-11 14:01:54,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2024-10-11 14:01:54,755 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 275 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 1344 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 1362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:54,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 1161 Invalid, 1362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1344 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 14:01:54,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2024-10-11 14:01:54,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 613. [2024-10-11 14:01:54,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 574 states have (on average 1.278745644599303) internal successors, (734), 574 states have internal predecessors, (734), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 14:01:54,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 806 transitions. [2024-10-11 14:01:54,796 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 806 transitions. Word has length 145 [2024-10-11 14:01:54,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:54,796 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 806 transitions. [2024-10-11 14:01:54,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-11 14:01:54,797 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 806 transitions. [2024-10-11 14:01:54,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-11 14:01:54,798 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:54,798 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:01:54,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-11 14:01:54,798 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:54,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:54,798 INFO L85 PathProgramCache]: Analyzing trace with hash -422793942, now seen corresponding path program 1 times [2024-10-11 14:01:54,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:54,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972782248] [2024-10-11 14:01:54,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:54,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:54,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:55,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:55,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:55,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:55,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:55,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:55,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:55,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:55,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:55,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:01:55,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:55,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:01:55,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:55,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:55,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:55,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:55,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:55,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:01:55,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:55,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:55,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:55,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:55,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:55,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:55,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:55,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:55,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:55,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:55,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:55,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:01:55,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:55,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:01:55,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:55,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:01:55,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:55,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:01:55,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:55,422 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 14:01:55,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:55,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972782248] [2024-10-11 14:01:55,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972782248] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:01:55,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:01:55,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 14:01:55,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890643543] [2024-10-11 14:01:55,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:01:55,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 14:01:55,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:01:55,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 14:01:55,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-11 14:01:55,423 INFO L87 Difference]: Start difference. First operand 613 states and 806 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 14:01:56,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:01:56,162 INFO L93 Difference]: Finished difference Result 1286 states and 1663 transitions. [2024-10-11 14:01:56,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 14:01:56,162 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), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 145 [2024-10-11 14:01:56,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:01:56,165 INFO L225 Difference]: With dead ends: 1286 [2024-10-11 14:01:56,165 INFO L226 Difference]: Without dead ends: 877 [2024-10-11 14:01:56,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2024-10-11 14:01:56,166 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 158 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 855 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 14:01:56,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 655 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 855 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 14:01:56,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2024-10-11 14:01:56,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 631. [2024-10-11 14:01:56,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 592 states have (on average 1.277027027027027) internal successors, (756), 592 states have internal predecessors, (756), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 14:01:56,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 828 transitions. [2024-10-11 14:01:56,207 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 828 transitions. Word has length 145 [2024-10-11 14:01:56,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:01:56,207 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 828 transitions. [2024-10-11 14:01:56,207 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), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-11 14:01:56,208 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 828 transitions. [2024-10-11 14:01:56,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-11 14:01:56,208 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:01:56,208 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:01:56,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-11 14:01:56,209 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:01:56,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:01:56,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1739151683, now seen corresponding path program 1 times [2024-10-11 14:01:56,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:01:56,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629557371] [2024-10-11 14:01:56,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:56,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:01:56,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:58,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:01:58,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:58,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 14:01:58,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:58,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:01:58,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:58,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:01:58,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:58,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:01:58,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:58,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:01:58,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:58,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:01:58,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:58,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:01:58,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:58,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:01:58,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:58,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:01:58,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:58,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:01:58,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:58,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:01:58,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:58,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 14:01:58,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:58,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 14:01:58,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:58,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 14:01:58,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:58,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 14:01:58,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:58,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 14:01:58,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:58,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 14:01:58,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:58,592 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 6 proven. 45 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-10-11 14:01:58,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:01:58,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629557371] [2024-10-11 14:01:58,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629557371] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:01:58,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412896249] [2024-10-11 14:01:58,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:01:58,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:01:58,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:01:58,596 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:01:58,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 14:01:58,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:01:58,957 INFO L255 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 87 conjuncts are in the unsatisfiable core [2024-10-11 14:01:58,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:01:59,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-11 14:01:59,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-10-11 14:02:00,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2024-10-11 14:02:00,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2024-10-11 14:02:01,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2024-10-11 14:02:01,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2024-10-11 14:02:01,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2024-10-11 14:02:02,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2024-10-11 14:02:02,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2024-10-11 14:02:03,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2024-10-11 14:02:03,562 INFO L349 Elim1Store]: treesize reduction 49, result has 12.5 percent of original size [2024-10-11 14:02:03,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 37 [2024-10-11 14:02:03,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:03,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:03,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:03,761 INFO L349 Elim1Store]: treesize reduction 57, result has 20.8 percent of original size [2024-10-11 14:02:03,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 48 [2024-10-11 14:02:03,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:03,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 14:02:03,859 INFO L349 Elim1Store]: treesize reduction 45, result has 25.0 percent of original size [2024-10-11 14:02:03,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 49 [2024-10-11 14:02:04,096 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 13 proven. 279 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2024-10-11 14:02:04,096 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:02:08,505 WARN L851 $PredicateComparison]: unable to prove that (forall ((~WrapperStruct00_var_1_3_Pointer~0.base Int) (~WrapperStruct00_var_1_3_Pointer~0.offset Int) (v_ArrVal_1751 Int)) (not (let ((.cse0 (let ((.cse1 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_15_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_15_Pointer~0.base) c_~WrapperStruct00_var_1_15_Pointer~0.offset v_ArrVal_1751)))) (store .cse1 c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select .cse1 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset (+ (* (- 1) (select (select .cse1 c_~WrapperStruct00_var_1_4_Pointer~0.base) c_~WrapperStruct00_var_1_4_Pointer~0.offset)) (* (mod (select (select .cse1 c_~WrapperStruct00_var_1_12_Pointer~0.base) c_~WrapperStruct00_var_1_12_Pointer~0.offset) 65536) 2) (select (select .cse1 ~WrapperStruct00_var_1_3_Pointer~0.base) ~WrapperStruct00_var_1_3_Pointer~0.offset))))))) (= (mod (select (select .cse0 c_~WrapperStruct00_var_1_12_Pointer~0.base) c_~WrapperStruct00_var_1_12_Pointer~0.offset) 65536) (mod (select (select .cse0 c_~WrapperStruct00_var_1_4_Pointer~0.base) c_~WrapperStruct00_var_1_4_Pointer~0.offset) 4294967296))))) is different from false