./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-27.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-27.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 cdeaaf68ec6b818190b10daa08c2d0ca8b7505d1cb1ac039886c6ec324698b15 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:57:23,193 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:57:23,260 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 13:57:23,264 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:57:23,265 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:57:23,295 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:57:23,296 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:57:23,296 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:57:23,297 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:57:23,297 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:57:23,298 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:57:23,298 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:57:23,299 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:57:23,299 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:57:23,299 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:57:23,300 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:57:23,300 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:57:23,301 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:57:23,301 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:57:23,301 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:57:23,302 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:57:23,302 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:57:23,303 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:57:23,303 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:57:23,303 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:57:23,304 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:57:23,304 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:57:23,304 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:57:23,305 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:57:23,305 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:57:23,306 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:57:23,306 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:57:23,306 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:57:23,306 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:57:23,307 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:57:23,307 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:57:23,307 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:57:23,308 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:57:23,308 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:57:23,308 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:57:23,308 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:57:23,312 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:57:23,313 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 -> cdeaaf68ec6b818190b10daa08c2d0ca8b7505d1cb1ac039886c6ec324698b15 [2024-10-11 13:57:23,635 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:57:23,662 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:57:23,665 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:57:23,667 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:57:23,667 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:57:23,668 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-27.i [2024-10-11 13:57:25,116 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:57:25,323 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:57:25,324 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-27.i [2024-10-11 13:57:25,335 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d7868150d/452cb5e34e424984994d07327c4c8c1b/FLAG35e4b3057 [2024-10-11 13:57:25,347 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d7868150d/452cb5e34e424984994d07327c4c8c1b [2024-10-11 13:57:25,349 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:57:25,350 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:57:25,351 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:57:25,351 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:57:25,356 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:57:25,356 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:57:25" (1/1) ... [2024-10-11 13:57:25,357 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bb849f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:57:25, skipping insertion in model container [2024-10-11 13:57:25,357 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:57:25" (1/1) ... [2024-10-11 13:57:25,380 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:57:25,538 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-27.i[917,930] [2024-10-11 13:57:25,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:57:25,608 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:57:25,619 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-27.i[917,930] [2024-10-11 13:57:25,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:57:25,674 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:57:25,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:57:25 WrapperNode [2024-10-11 13:57:25,674 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:57:25,675 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:57:25,675 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:57:25,676 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:57:25,682 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:57:25" (1/1) ... [2024-10-11 13:57:25,693 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:57:25" (1/1) ... [2024-10-11 13:57:25,734 INFO L138 Inliner]: procedures = 26, calls = 152, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 439 [2024-10-11 13:57:25,735 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:57:25,735 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:57:25,735 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:57:25,735 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:57:25,747 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:57:25" (1/1) ... [2024-10-11 13:57:25,747 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:57:25" (1/1) ... [2024-10-11 13:57:25,752 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:57:25" (1/1) ... [2024-10-11 13:57:25,774 INFO L175 MemorySlicer]: Split 123 memory accesses to 2 slices as follows [2, 121]. 98 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 12]. The 16 writes are split as follows [0, 16]. [2024-10-11 13:57:25,778 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:57:25" (1/1) ... [2024-10-11 13:57:25,779 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:57:25" (1/1) ... [2024-10-11 13:57:25,795 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:57:25" (1/1) ... [2024-10-11 13:57:25,801 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:57:25" (1/1) ... [2024-10-11 13:57:25,803 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:57:25" (1/1) ... [2024-10-11 13:57:25,805 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:57:25" (1/1) ... [2024-10-11 13:57:25,812 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:57:25,813 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:57:25,813 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:57:25,813 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:57:25,814 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:57:25" (1/1) ... [2024-10-11 13:57:25,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:57:25,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:57:25,852 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 13:57:25,856 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 13:57:25,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:57:25,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 13:57:25,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 13:57:25,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 13:57:25,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 13:57:25,914 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:57:25,914 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:57:25,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:57:25,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 13:57:25,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:57:25,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:57:26,051 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:57:26,054 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:57:26,496 INFO L? ?]: Removed 110 outVars from TransFormulas that were not future-live. [2024-10-11 13:57:26,497 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:57:26,536 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:57:26,537 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:57:26,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:57:26 BoogieIcfgContainer [2024-10-11 13:57:26,537 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:57:26,539 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:57:26,540 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:57:26,543 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:57:26,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:57:25" (1/3) ... [2024-10-11 13:57:26,544 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7891bb4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:57:26, skipping insertion in model container [2024-10-11 13:57:26,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:57:25" (2/3) ... [2024-10-11 13:57:26,545 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7891bb4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:57:26, skipping insertion in model container [2024-10-11 13:57:26,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:57:26" (3/3) ... [2024-10-11 13:57:26,546 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-27.i [2024-10-11 13:57:26,561 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:57:26,562 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:57:26,626 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:57:26,631 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@23e5f1cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:57:26,631 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:57:26,634 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 68 states have internal predecessors, (95), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 13:57:26,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-11 13:57:26,644 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:57:26,645 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:57:26,645 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:57:26,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:57:26,649 INFO L85 PathProgramCache]: Analyzing trace with hash -708701951, now seen corresponding path program 1 times [2024-10-11 13:57:26,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:57:26,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895937423] [2024-10-11 13:57:26,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:57:26,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:57:26,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:26,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:57:26,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:26,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:57:26,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:26,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:57:26,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:26,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:57:26,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:26,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:57:26,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:26,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:57:26,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:26,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:57:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:26,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:57:26,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:26,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:57:26,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:26,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:57:26,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:26,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:57:26,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:26,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:57:26,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:27,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:57:27,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:27,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:57:27,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:27,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:57:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:27,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:57:27,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:27,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:57:27,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:27,036 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:57:27,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:57:27,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895937423] [2024-10-11 13:57:27,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895937423] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:57:27,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:57:27,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:57:27,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558707219] [2024-10-11 13:57:27,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:57:27,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:57:27,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:57:27,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:57:27,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:57:27,074 INFO L87 Difference]: Start difference. First operand has 87 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 68 states have internal predecessors, (95), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 13:57:27,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:57:27,120 INFO L93 Difference]: Finished difference Result 171 states and 273 transitions. [2024-10-11 13:57:27,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:57:27,124 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 126 [2024-10-11 13:57:27,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:57:27,133 INFO L225 Difference]: With dead ends: 171 [2024-10-11 13:57:27,133 INFO L226 Difference]: Without dead ends: 85 [2024-10-11 13:57:27,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 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 13:57:27,142 INFO L432 NwaCegarLoop]: 120 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, 120 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 13:57:27,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:57:27,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-11 13:57:27,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-10-11 13:57:27,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 66 states have internal predecessors, (90), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 13:57:27,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 124 transitions. [2024-10-11 13:57:27,197 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 124 transitions. Word has length 126 [2024-10-11 13:57:27,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:57:27,198 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 124 transitions. [2024-10-11 13:57:27,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 13:57:27,198 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 124 transitions. [2024-10-11 13:57:27,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-11 13:57:27,201 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:57:27,202 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:57:27,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:57:27,202 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:57:27,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:57:27,203 INFO L85 PathProgramCache]: Analyzing trace with hash -941775073, now seen corresponding path program 1 times [2024-10-11 13:57:27,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:57:27,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594675361] [2024-10-11 13:57:27,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:57:27,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:57:27,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:28,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:57:28,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:28,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:57:28,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:28,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:57:28,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:28,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:57:28,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:28,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:57:28,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:28,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:57:28,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:28,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:57:28,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:28,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:57:28,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:28,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:57:28,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:28,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:57:28,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:28,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:57:28,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:28,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:57:28,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:28,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:57:28,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:28,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:57:28,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:28,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:57:28,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:28,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:57:28,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:28,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:57:28,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:28,903 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:57:28,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:57:28,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594675361] [2024-10-11 13:57:28,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594675361] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:57:28,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:57:28,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:57:28,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941480616] [2024-10-11 13:57:28,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:57:28,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:57:28,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:57:28,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:57:28,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:57:28,907 INFO L87 Difference]: Start difference. First operand 85 states and 124 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-11 13:57:29,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:57:29,272 INFO L93 Difference]: Finished difference Result 219 states and 320 transitions. [2024-10-11 13:57:29,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:57:29,272 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 126 [2024-10-11 13:57:29,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:57:29,275 INFO L225 Difference]: With dead ends: 219 [2024-10-11 13:57:29,276 INFO L226 Difference]: Without dead ends: 135 [2024-10-11 13:57:29,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:57:29,279 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 57 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:57:29,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 366 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:57:29,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-11 13:57:29,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 131. [2024-10-11 13:57:29,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 94 states have (on average 1.297872340425532) internal successors, (122), 94 states have internal predecessors, (122), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 13:57:29,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 190 transitions. [2024-10-11 13:57:29,313 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 190 transitions. Word has length 126 [2024-10-11 13:57:29,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:57:29,314 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 190 transitions. [2024-10-11 13:57:29,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-11 13:57:29,315 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 190 transitions. [2024-10-11 13:57:29,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-11 13:57:29,318 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:57:29,318 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:57:29,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 13:57:29,319 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:57:29,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:57:29,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1052369633, now seen corresponding path program 1 times [2024-10-11 13:57:29,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:57:29,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156172233] [2024-10-11 13:57:29,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:57:29,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:57:29,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:30,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:57:30,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:30,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:57:30,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:30,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:57:30,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:30,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:57:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:30,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:57:30,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:30,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:57:30,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:30,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:57:30,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:30,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:57:30,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:30,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:57:30,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:30,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:57:30,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:30,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:57:30,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:30,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:57:30,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:30,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:57:30,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:30,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:57:30,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:30,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:57:30,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:30,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:57:30,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:30,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:57:30,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:30,145 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:57:30,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:57:30,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156172233] [2024-10-11 13:57:30,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156172233] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:57:30,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:57:30,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 13:57:30,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269114576] [2024-10-11 13:57:30,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:57:30,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:57:30,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:57:30,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:57:30,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:57:30,151 INFO L87 Difference]: Start difference. First operand 131 states and 190 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 13:57:30,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:57:30,569 INFO L93 Difference]: Finished difference Result 224 states and 327 transitions. [2024-10-11 13:57:30,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:57:30,571 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 126 [2024-10-11 13:57:30,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:57:30,573 INFO L225 Difference]: With dead ends: 224 [2024-10-11 13:57:30,575 INFO L226 Difference]: Without dead ends: 140 [2024-10-11 13:57:30,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 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 13:57:30,577 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 113 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:57:30,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 213 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:57:30,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-10-11 13:57:30,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2024-10-11 13:57:30,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 102 states have (on average 1.303921568627451) internal successors, (133), 102 states have internal predecessors, (133), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 13:57:30,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 201 transitions. [2024-10-11 13:57:30,618 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 201 transitions. Word has length 126 [2024-10-11 13:57:30,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:57:30,621 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 201 transitions. [2024-10-11 13:57:30,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 13:57:30,622 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 201 transitions. [2024-10-11 13:57:30,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-11 13:57:30,626 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:57:30,627 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:57:30,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 13:57:30,627 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:57:30,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:57:30,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1550115519, now seen corresponding path program 1 times [2024-10-11 13:57:30,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:57:30,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472055141] [2024-10-11 13:57:30,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:57:30,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:57:30,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:32,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:57:32,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:32,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:57:32,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:32,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:57:32,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:32,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:57:32,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:32,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:57:32,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:32,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:57:32,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:32,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:57:32,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:32,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:57:32,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:32,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:57:32,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:32,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:57:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:32,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:57:32,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:32,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:57:32,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:32,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:57:32,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:32,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:57:32,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:32,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:57:32,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:32,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:57:32,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:32,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:57:32,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:32,713 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:57:32,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:57:32,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472055141] [2024-10-11 13:57:32,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472055141] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:57:32,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:57:32,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 13:57:32,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950930376] [2024-10-11 13:57:32,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:57:32,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 13:57:32,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:57:32,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 13:57:32,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:57:32,716 INFO L87 Difference]: Start difference. First operand 139 states and 201 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-11 13:57:33,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:57:33,613 INFO L93 Difference]: Finished difference Result 241 states and 350 transitions. [2024-10-11 13:57:33,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:57:33,614 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 127 [2024-10-11 13:57:33,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:57:33,615 INFO L225 Difference]: With dead ends: 241 [2024-10-11 13:57:33,615 INFO L226 Difference]: Without dead ends: 149 [2024-10-11 13:57:33,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2024-10-11 13:57:33,617 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 248 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 13:57:33,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 250 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 13:57:33,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-10-11 13:57:33,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 144. [2024-10-11 13:57:33,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 107 states have (on average 1.2990654205607477) internal successors, (139), 107 states have internal predecessors, (139), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 13:57:33,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 207 transitions. [2024-10-11 13:57:33,660 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 207 transitions. Word has length 127 [2024-10-11 13:57:33,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:57:33,661 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 207 transitions. [2024-10-11 13:57:33,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-11 13:57:33,662 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 207 transitions. [2024-10-11 13:57:33,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-11 13:57:33,664 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:57:33,664 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:57:33,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 13:57:33,665 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:57:33,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:57:33,667 INFO L85 PathProgramCache]: Analyzing trace with hash 538998269, now seen corresponding path program 1 times [2024-10-11 13:57:33,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:57:33,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490990824] [2024-10-11 13:57:33,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:57:33,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:57:33,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:35,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:57:35,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:35,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:57:35,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:35,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:57:35,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:35,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:57:35,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:35,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:57:35,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:35,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:57:35,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:35,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:57:35,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:35,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:57:35,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:35,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:57:35,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:35,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:57:35,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:35,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:57:35,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:35,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:57:35,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:35,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:57:35,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:35,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:57:35,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:35,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:57:35,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:35,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:57:35,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:35,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:57:35,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:35,855 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:57:35,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:57:35,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490990824] [2024-10-11 13:57:35,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490990824] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:57:35,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:57:35,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 13:57:35,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433039032] [2024-10-11 13:57:35,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:57:35,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 13:57:35,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:57:35,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 13:57:35,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:57:35,860 INFO L87 Difference]: Start difference. First operand 144 states and 207 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-11 13:57:36,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:57:36,505 INFO L93 Difference]: Finished difference Result 282 states and 406 transitions. [2024-10-11 13:57:36,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:57:36,508 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 127 [2024-10-11 13:57:36,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:57:36,510 INFO L225 Difference]: With dead ends: 282 [2024-10-11 13:57:36,510 INFO L226 Difference]: Without dead ends: 185 [2024-10-11 13:57:36,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2024-10-11 13:57:36,513 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 386 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:57:36,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 288 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:57:36,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-10-11 13:57:36,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 157. [2024-10-11 13:57:36,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 120 states have (on average 1.3083333333333333) internal successors, (157), 120 states have internal predecessors, (157), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 13:57:36,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 225 transitions. [2024-10-11 13:57:36,557 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 225 transitions. Word has length 127 [2024-10-11 13:57:36,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:57:36,559 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 225 transitions. [2024-10-11 13:57:36,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-11 13:57:36,559 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 225 transitions. [2024-10-11 13:57:36,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-11 13:57:36,561 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:57:36,561 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:57:36,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 13:57:36,562 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:57:36,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:57:36,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1271410916, now seen corresponding path program 1 times [2024-10-11 13:57:36,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:57:36,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291452361] [2024-10-11 13:57:36,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:57:36,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:57:36,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:37,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:57:37,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:37,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:57:37,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:37,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:57:37,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:37,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:57:37,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:37,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:57:37,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:37,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:57:37,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:37,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:57:37,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:37,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:57:37,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:37,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:57:37,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:37,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:57:37,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:37,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:57:37,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:37,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:57:37,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:37,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:57:37,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:37,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:57:37,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:37,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:57:37,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:37,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:57:37,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:37,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:57:37,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:37,699 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:57:37,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:57:37,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291452361] [2024-10-11 13:57:37,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291452361] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:57:37,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:57:37,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 13:57:37,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062042888] [2024-10-11 13:57:37,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:57:37,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:57:37,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:57:37,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:57:37,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:57:37,701 INFO L87 Difference]: Start difference. First operand 157 states and 225 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-11 13:57:38,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:57:38,082 INFO L93 Difference]: Finished difference Result 359 states and 518 transitions. [2024-10-11 13:57:38,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:57:38,083 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 128 [2024-10-11 13:57:38,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:57:38,084 INFO L225 Difference]: With dead ends: 359 [2024-10-11 13:57:38,084 INFO L226 Difference]: Without dead ends: 249 [2024-10-11 13:57:38,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:57:38,086 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 204 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:57:38,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 345 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:57:38,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-10-11 13:57:38,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 237. [2024-10-11 13:57:38,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 182 states have (on average 1.3241758241758241) internal successors, (241), 182 states have internal predecessors, (241), 51 states have call successors, (51), 3 states have call predecessors, (51), 3 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-11 13:57:38,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 343 transitions. [2024-10-11 13:57:38,138 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 343 transitions. Word has length 128 [2024-10-11 13:57:38,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:57:38,139 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 343 transitions. [2024-10-11 13:57:38,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-11 13:57:38,139 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 343 transitions. [2024-10-11 13:57:38,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-11 13:57:38,140 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:57:38,140 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:57:38,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 13:57:38,141 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:57:38,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:57:38,141 INFO L85 PathProgramCache]: Analyzing trace with hash -613481340, now seen corresponding path program 1 times [2024-10-11 13:57:38,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:57:38,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96713227] [2024-10-11 13:57:38,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:57:38,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:57:38,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:38,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:57:38,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:38,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:57:38,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:38,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:57:38,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:38,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:57:38,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:38,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:57:38,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:38,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:57:38,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:38,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:57:38,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:38,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:57:38,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:38,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:57:38,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:38,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:57:38,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:38,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:57:38,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:38,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:57:38,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:38,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:57:38,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:38,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:57:38,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:38,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:57:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:38,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:57:38,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:38,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:57:38,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:38,661 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:57:38,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:57:38,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96713227] [2024-10-11 13:57:38,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96713227] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:57:38,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:57:38,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 13:57:38,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106214430] [2024-10-11 13:57:38,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:57:38,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:57:38,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:57:38,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:57:38,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:57:38,663 INFO L87 Difference]: Start difference. First operand 237 states and 343 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 13:57:39,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:57:39,148 INFO L93 Difference]: Finished difference Result 408 states and 590 transitions. [2024-10-11 13:57:39,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:57:39,149 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 129 [2024-10-11 13:57:39,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:57:39,153 INFO L225 Difference]: With dead ends: 408 [2024-10-11 13:57:39,153 INFO L226 Difference]: Without dead ends: 298 [2024-10-11 13:57:39,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-11 13:57:39,155 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 135 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:57:39,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 309 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:57:39,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-10-11 13:57:39,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 237. [2024-10-11 13:57:39,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 182 states have (on average 1.3186813186813187) internal successors, (240), 182 states have internal predecessors, (240), 51 states have call successors, (51), 3 states have call predecessors, (51), 3 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-11 13:57:39,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 342 transitions. [2024-10-11 13:57:39,213 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 342 transitions. Word has length 129 [2024-10-11 13:57:39,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:57:39,214 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 342 transitions. [2024-10-11 13:57:39,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 13:57:39,214 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 342 transitions. [2024-10-11 13:57:39,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-11 13:57:39,215 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:57:39,215 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:57:39,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 13:57:39,215 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:57:39,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:57:39,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1058583998, now seen corresponding path program 1 times [2024-10-11 13:57:39,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:57:39,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501356690] [2024-10-11 13:57:39,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:57:39,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:57:39,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:39,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:57:39,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:39,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:57:39,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:39,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:57:39,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:39,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:57:39,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:39,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:57:39,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:39,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:57:39,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:39,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:57:39,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:39,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:57:39,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:39,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:57:39,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:39,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:57:39,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:39,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:57:39,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:39,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:57:39,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:39,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:57:39,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:39,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:57:39,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:39,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:57:39,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:39,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:57:39,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:39,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:57:39,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:39,688 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:57:39,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:57:39,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501356690] [2024-10-11 13:57:39,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501356690] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:57:39,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:57:39,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:57:39,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102632569] [2024-10-11 13:57:39,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:57:39,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:57:39,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:57:39,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:57:39,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:57:39,690 INFO L87 Difference]: Start difference. First operand 237 states and 342 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:57:40,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:57:40,049 INFO L93 Difference]: Finished difference Result 458 states and 661 transitions. [2024-10-11 13:57:40,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:57:40,050 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 129 [2024-10-11 13:57:40,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:57:40,052 INFO L225 Difference]: With dead ends: 458 [2024-10-11 13:57:40,052 INFO L226 Difference]: Without dead ends: 261 [2024-10-11 13:57:40,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:57:40,053 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 118 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:57:40,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 260 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:57:40,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-10-11 13:57:40,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 191. [2024-10-11 13:57:40,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 154 states have (on average 1.3376623376623376) internal successors, (206), 154 states have internal predecessors, (206), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 13:57:40,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 274 transitions. [2024-10-11 13:57:40,093 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 274 transitions. Word has length 129 [2024-10-11 13:57:40,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:57:40,094 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 274 transitions. [2024-10-11 13:57:40,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:57:40,094 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 274 transitions. [2024-10-11 13:57:40,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-11 13:57:40,095 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:57:40,096 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:57:40,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 13:57:40,096 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:57:40,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:57:40,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1933859363, now seen corresponding path program 1 times [2024-10-11 13:57:40,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:57:40,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151541753] [2024-10-11 13:57:40,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:57:40,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:57:40,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:40,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:57:40,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:40,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:57:40,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:40,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:57:40,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:40,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:57:40,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:40,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:57:40,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:40,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:57:40,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:40,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:57:40,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:40,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:57:40,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:40,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:57:40,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:40,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:57:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:40,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:57:40,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:40,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:57:40,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:40,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:57:40,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:40,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:57:40,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:40,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:57:40,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:40,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:57:40,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:40,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:57:40,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:40,174 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:57:40,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:57:40,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151541753] [2024-10-11 13:57:40,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151541753] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:57:40,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:57:40,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:57:40,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169902630] [2024-10-11 13:57:40,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:57:40,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:57:40,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:57:40,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:57:40,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:57:40,177 INFO L87 Difference]: Start difference. First operand 191 states and 274 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:57:40,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:57:40,216 INFO L93 Difference]: Finished difference Result 383 states and 551 transitions. [2024-10-11 13:57:40,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:57:40,217 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 130 [2024-10-11 13:57:40,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:57:40,219 INFO L225 Difference]: With dead ends: 383 [2024-10-11 13:57:40,219 INFO L226 Difference]: Without dead ends: 193 [2024-10-11 13:57:40,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 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 13:57:40,221 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:57:40,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 233 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:57:40,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-10-11 13:57:40,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2024-10-11 13:57:40,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 156 states have (on average 1.3333333333333333) internal successors, (208), 156 states have internal predecessors, (208), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 13:57:40,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 276 transitions. [2024-10-11 13:57:40,248 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 276 transitions. Word has length 130 [2024-10-11 13:57:40,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:57:40,248 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 276 transitions. [2024-10-11 13:57:40,249 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:57:40,249 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 276 transitions. [2024-10-11 13:57:40,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-11 13:57:40,250 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:57:40,250 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:57:40,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 13:57:40,250 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:57:40,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:57:40,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1253800993, now seen corresponding path program 1 times [2024-10-11 13:57:40,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:57:40,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805236535] [2024-10-11 13:57:40,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:57:40,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:57:40,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:40,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:57:40,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:40,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:57:40,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:40,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:57:40,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:40,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:57:40,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:40,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:57:40,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:40,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:57:40,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:40,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:57:40,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:40,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:57:40,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:40,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:57:40,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:40,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:57:40,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:40,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:57:40,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:40,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:57:40,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:40,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:57:40,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:40,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:57:40,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:40,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:57:40,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:40,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:57:40,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:40,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:57:40,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:40,568 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:57:40,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:57:40,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805236535] [2024-10-11 13:57:40,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805236535] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:57:40,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:57:40,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:57:40,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997115113] [2024-10-11 13:57:40,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:57:40,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:57:40,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:57:40,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:57:40,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:57:40,570 INFO L87 Difference]: Start difference. First operand 193 states and 276 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:57:40,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:57:40,876 INFO L93 Difference]: Finished difference Result 447 states and 638 transitions. [2024-10-11 13:57:40,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:57:40,877 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 130 [2024-10-11 13:57:40,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:57:40,879 INFO L225 Difference]: With dead ends: 447 [2024-10-11 13:57:40,879 INFO L226 Difference]: Without dead ends: 255 [2024-10-11 13:57:40,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:57:40,881 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 156 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:57:40,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 242 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:57:40,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-10-11 13:57:40,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 211. [2024-10-11 13:57:40,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 174 states have (on average 1.3218390804597702) internal successors, (230), 174 states have internal predecessors, (230), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 13:57:40,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 298 transitions. [2024-10-11 13:57:40,917 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 298 transitions. Word has length 130 [2024-10-11 13:57:40,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:57:40,919 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 298 transitions. [2024-10-11 13:57:40,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:57:40,919 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 298 transitions. [2024-10-11 13:57:40,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-11 13:57:40,920 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:57:40,920 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:57:40,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 13:57:40,920 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:57:40,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:57:40,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1540832353, now seen corresponding path program 1 times [2024-10-11 13:57:40,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:57:40,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219286190] [2024-10-11 13:57:40,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:57:40,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:57:40,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:41,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:57:41,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:41,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:57:41,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:41,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:57:41,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:41,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:57:41,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:41,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:57:41,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:41,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:57:41,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:41,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:57:41,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:41,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:57:41,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:41,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:57:41,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:41,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:57:41,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:41,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:57:41,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:41,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:57:41,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:41,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:57:41,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:41,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:57:41,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:41,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:57:41,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:41,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:57:41,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:41,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:57:41,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:41,077 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:57:41,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:57:41,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219286190] [2024-10-11 13:57:41,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219286190] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:57:41,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:57:41,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:57:41,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768977613] [2024-10-11 13:57:41,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:57:41,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:57:41,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:57:41,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:57:41,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:57:41,080 INFO L87 Difference]: Start difference. First operand 211 states and 298 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:57:41,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:57:41,133 INFO L93 Difference]: Finished difference Result 427 states and 603 transitions. [2024-10-11 13:57:41,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:57:41,134 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 130 [2024-10-11 13:57:41,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:57:41,137 INFO L225 Difference]: With dead ends: 427 [2024-10-11 13:57:41,137 INFO L226 Difference]: Without dead ends: 217 [2024-10-11 13:57:41,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 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 13:57:41,138 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:57:41,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 457 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:57:41,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-10-11 13:57:41,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2024-10-11 13:57:41,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 180 states have (on average 1.3111111111111111) internal successors, (236), 180 states have internal predecessors, (236), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 13:57:41,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 304 transitions. [2024-10-11 13:57:41,167 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 304 transitions. Word has length 130 [2024-10-11 13:57:41,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:57:41,167 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 304 transitions. [2024-10-11 13:57:41,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:57:41,167 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 304 transitions. [2024-10-11 13:57:41,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-11 13:57:41,169 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:57:41,169 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:57:41,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 13:57:41,169 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:57:41,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:57:41,169 INFO L85 PathProgramCache]: Analyzing trace with hash 860773983, now seen corresponding path program 1 times [2024-10-11 13:57:41,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:57:41,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344523333] [2024-10-11 13:57:41,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:57:41,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:57:41,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:42,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:57:42,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:42,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:57:42,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:42,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:57:42,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:42,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:57:42,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:42,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:57:42,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:42,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:57:42,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:42,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:57:42,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:42,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:57:42,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:42,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:57:42,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:42,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:57:42,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:42,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:57:42,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:42,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:57:42,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:42,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:57:42,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:42,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:57:42,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:42,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:57:42,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:42,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:57:42,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:42,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:57:42,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:42,224 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:57:42,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:57:42,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344523333] [2024-10-11 13:57:42,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344523333] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:57:42,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:57:42,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 13:57:42,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997956337] [2024-10-11 13:57:42,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:57:42,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 13:57:42,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:57:42,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 13:57:42,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:57:42,227 INFO L87 Difference]: Start difference. First operand 217 states and 304 transitions. Second operand has 9 states, 8 states have (on average 6.0) internal successors, (48), 9 states have internal predecessors, (48), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-11 13:57:42,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:57:42,736 INFO L93 Difference]: Finished difference Result 483 states and 681 transitions. [2024-10-11 13:57:42,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:57:42,737 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 9 states have internal predecessors, (48), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 130 [2024-10-11 13:57:42,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:57:42,739 INFO L225 Difference]: With dead ends: 483 [2024-10-11 13:57:42,739 INFO L226 Difference]: Without dead ends: 267 [2024-10-11 13:57:42,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:57:42,740 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 228 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:57:42,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 217 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:57:42,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-10-11 13:57:42,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 240. [2024-10-11 13:57:42,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 203 states have (on average 1.3251231527093597) internal successors, (269), 203 states have internal predecessors, (269), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 13:57:42,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 337 transitions. [2024-10-11 13:57:42,773 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 337 transitions. Word has length 130 [2024-10-11 13:57:42,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:57:42,774 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 337 transitions. [2024-10-11 13:57:42,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 9 states have internal predecessors, (48), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-11 13:57:42,774 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 337 transitions. [2024-10-11 13:57:42,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-11 13:57:42,776 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:57:42,776 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:57:42,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 13:57:42,776 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:57:42,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:57:42,777 INFO L85 PathProgramCache]: Analyzing trace with hash 262512057, now seen corresponding path program 1 times [2024-10-11 13:57:42,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:57:42,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150474578] [2024-10-11 13:57:42,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:57:42,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:57:42,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:44,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:57:44,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:44,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:57:44,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:44,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:57:44,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:44,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:57:44,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:44,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:57:44,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:44,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:57:44,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:44,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:57:44,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:44,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:57:44,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:44,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:57:44,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:44,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:57:44,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:44,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:57:44,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:44,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:57:44,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:44,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:57:44,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:44,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:57:44,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:44,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:57:44,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:44,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:57:44,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:44,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:57:44,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:44,804 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:57:44,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:57:44,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150474578] [2024-10-11 13:57:44,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150474578] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:57:44,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:57:44,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-11 13:57:44,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429057042] [2024-10-11 13:57:44,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:57:44,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 13:57:44,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:57:44,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 13:57:44,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-10-11 13:57:44,807 INFO L87 Difference]: Start difference. First operand 240 states and 337 transitions. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:57:45,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:57:45,803 INFO L93 Difference]: Finished difference Result 640 states and 895 transitions. [2024-10-11 13:57:45,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 13:57:45,804 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 130 [2024-10-11 13:57:45,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:57:45,807 INFO L225 Difference]: With dead ends: 640 [2024-10-11 13:57:45,807 INFO L226 Difference]: Without dead ends: 401 [2024-10-11 13:57:45,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2024-10-11 13:57:45,809 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 291 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 13:57:45,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 410 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 13:57:45,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-10-11 13:57:45,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 349. [2024-10-11 13:57:45,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 312 states have (on average 1.3461538461538463) internal successors, (420), 312 states have internal predecessors, (420), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 13:57:45,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 488 transitions. [2024-10-11 13:57:45,864 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 488 transitions. Word has length 130 [2024-10-11 13:57:45,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:57:45,864 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 488 transitions. [2024-10-11 13:57:45,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:57:45,864 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 488 transitions. [2024-10-11 13:57:45,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-11 13:57:45,866 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:57:45,867 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:57:45,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 13:57:45,867 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:57:45,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:57:45,867 INFO L85 PathProgramCache]: Analyzing trace with hash 403060667, now seen corresponding path program 1 times [2024-10-11 13:57:45,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:57:45,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550102095] [2024-10-11 13:57:45,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:57:45,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:57:45,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:45,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:57:45,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:45,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:57:45,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:45,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:57:45,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:45,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:57:45,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:45,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:57:45,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:45,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:57:45,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:45,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:57:45,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:45,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:57:45,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:45,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:57:45,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:45,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:57:45,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:45,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:57:45,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:45,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:57:45,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:45,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:57:45,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:45,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:57:45,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:45,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:57:45,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:45,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:57:45,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:45,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:57:45,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:45,942 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:57:45,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:57:45,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550102095] [2024-10-11 13:57:45,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550102095] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:57:45,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:57:45,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:57:45,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710324916] [2024-10-11 13:57:45,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:57:45,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:57:45,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:57:45,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:57:45,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:57:45,945 INFO L87 Difference]: Start difference. First operand 349 states and 488 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:57:45,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:57:45,995 INFO L93 Difference]: Finished difference Result 676 states and 946 transitions. [2024-10-11 13:57:45,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:57:45,995 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 130 [2024-10-11 13:57:45,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:57:45,997 INFO L225 Difference]: With dead ends: 676 [2024-10-11 13:57:45,997 INFO L226 Difference]: Without dead ends: 328 [2024-10-11 13:57:45,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 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 13:57:45,998 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:57:45,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 234 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:57:46,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2024-10-11 13:57:46,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2024-10-11 13:57:46,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 291 states have (on average 1.3367697594501717) internal successors, (389), 291 states have internal predecessors, (389), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 13:57:46,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 457 transitions. [2024-10-11 13:57:46,038 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 457 transitions. Word has length 130 [2024-10-11 13:57:46,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:57:46,039 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 457 transitions. [2024-10-11 13:57:46,039 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:57:46,039 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 457 transitions. [2024-10-11 13:57:46,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-11 13:57:46,040 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:57:46,041 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:57:46,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 13:57:46,041 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:57:46,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:57:46,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1522627161, now seen corresponding path program 1 times [2024-10-11 13:57:46,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:57:46,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406920082] [2024-10-11 13:57:46,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:57:46,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:57:46,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:47,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:57:47,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:47,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:57:47,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:47,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:57:47,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:47,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:57:47,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:47,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:57:47,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:47,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:57:47,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:47,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:57:47,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:47,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:57:47,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:47,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:57:47,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:47,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:57:47,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:47,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:57:47,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:47,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:57:47,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:47,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:57:47,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:47,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:57:47,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:47,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:57:47,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:47,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:57:47,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:47,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:57:47,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:47,666 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:57:47,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:57:47,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406920082] [2024-10-11 13:57:47,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406920082] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:57:47,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:57:47,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-11 13:57:47,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935951867] [2024-10-11 13:57:47,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:57:47,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 13:57:47,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:57:47,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 13:57:47,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-10-11 13:57:47,669 INFO L87 Difference]: Start difference. First operand 328 states and 457 transitions. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 13:57:48,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:57:48,701 INFO L93 Difference]: Finished difference Result 830 states and 1152 transitions. [2024-10-11 13:57:48,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 13:57:48,702 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 130 [2024-10-11 13:57:48,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:57:48,705 INFO L225 Difference]: With dead ends: 830 [2024-10-11 13:57:48,705 INFO L226 Difference]: Without dead ends: 503 [2024-10-11 13:57:48,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2024-10-11 13:57:48,707 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 206 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 13:57:48,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 480 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 13:57:48,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2024-10-11 13:57:48,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 407. [2024-10-11 13:57:48,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 370 states have (on average 1.327027027027027) internal successors, (491), 370 states have internal predecessors, (491), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 13:57:48,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 559 transitions. [2024-10-11 13:57:48,754 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 559 transitions. Word has length 130 [2024-10-11 13:57:48,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:57:48,755 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 559 transitions. [2024-10-11 13:57:48,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 13:57:48,755 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 559 transitions. [2024-10-11 13:57:48,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-11 13:57:48,757 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:57:48,757 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:57:48,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 13:57:48,758 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:57:48,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:57:48,758 INFO L85 PathProgramCache]: Analyzing trace with hash -821562583, now seen corresponding path program 1 times [2024-10-11 13:57:48,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:57:48,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411885353] [2024-10-11 13:57:48,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:57:48,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:57:48,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:50,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:57:50,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:50,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:57:50,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:50,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:57:50,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:50,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:57:50,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:50,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:57:50,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:50,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:57:50,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:50,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:57:50,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:50,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:57:50,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:50,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:57:50,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:50,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:57:50,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:50,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:57:50,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:50,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:57:50,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:50,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:57:50,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:50,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:57:50,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:50,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:57:50,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:50,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:57:50,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:50,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:57:50,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:50,888 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:57:50,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:57:50,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411885353] [2024-10-11 13:57:50,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411885353] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:57:50,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:57:50,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-11 13:57:50,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803022305] [2024-10-11 13:57:50,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:57:50,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 13:57:50,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:57:50,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 13:57:50,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-10-11 13:57:50,892 INFO L87 Difference]: Start difference. First operand 407 states and 559 transitions. Second operand has 14 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2024-10-11 13:57:51,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:57:51,749 INFO L93 Difference]: Finished difference Result 885 states and 1214 transitions. [2024-10-11 13:57:51,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:57:51,751 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 130 [2024-10-11 13:57:51,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:57:51,753 INFO L225 Difference]: With dead ends: 885 [2024-10-11 13:57:51,755 INFO L226 Difference]: Without dead ends: 479 [2024-10-11 13:57:51,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2024-10-11 13:57:51,760 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 297 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 13:57:51,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 366 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 13:57:51,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2024-10-11 13:57:51,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 407. [2024-10-11 13:57:51,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 370 states have (on average 1.3054054054054054) internal successors, (483), 370 states have internal predecessors, (483), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 13:57:51,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 551 transitions. [2024-10-11 13:57:51,817 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 551 transitions. Word has length 130 [2024-10-11 13:57:51,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:57:51,818 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 551 transitions. [2024-10-11 13:57:51,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2024-10-11 13:57:51,819 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 551 transitions. [2024-10-11 13:57:51,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-11 13:57:51,820 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:57:51,820 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:57:51,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 13:57:51,820 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:57:51,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:57:51,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1083396393, now seen corresponding path program 1 times [2024-10-11 13:57:51,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:57:51,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899169175] [2024-10-11 13:57:51,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:57:51,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:57:51,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:54,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:57:54,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:54,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:57:54,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:54,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:57:54,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:54,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:57:54,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:54,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:57:54,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:54,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:57:54,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:54,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:57:54,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:54,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:57:54,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:54,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:57:54,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:54,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:57:54,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:54,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:57:54,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:54,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:57:54,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:54,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:57:54,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:54,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:57:54,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:54,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:57:54,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:54,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:57:54,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:54,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:57:54,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:54,527 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:57:54,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:57:54,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899169175] [2024-10-11 13:57:54,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899169175] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:57:54,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:57:54,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-11 13:57:54,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88792344] [2024-10-11 13:57:54,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:57:54,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 13:57:54,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:57:54,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 13:57:54,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2024-10-11 13:57:54,530 INFO L87 Difference]: Start difference. First operand 407 states and 551 transitions. Second operand has 16 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 16 states have internal predecessors, (48), 6 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 6 states have call successors, (17) [2024-10-11 13:57:55,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:57:55,570 INFO L93 Difference]: Finished difference Result 893 states and 1208 transitions. [2024-10-11 13:57:55,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 13:57:55,571 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 16 states have internal predecessors, (48), 6 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 6 states have call successors, (17) Word has length 130 [2024-10-11 13:57:55,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:57:55,573 INFO L225 Difference]: With dead ends: 893 [2024-10-11 13:57:55,574 INFO L226 Difference]: Without dead ends: 487 [2024-10-11 13:57:55,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2024-10-11 13:57:55,576 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 206 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 13:57:55,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 401 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 13:57:55,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2024-10-11 13:57:55,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 483. [2024-10-11 13:57:55,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 440 states have (on average 1.2977272727272726) internal successors, (571), 442 states have internal predecessors, (571), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 13:57:55,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 647 transitions. [2024-10-11 13:57:55,636 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 647 transitions. Word has length 130 [2024-10-11 13:57:55,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:57:55,636 INFO L471 AbstractCegarLoop]: Abstraction has 483 states and 647 transitions. [2024-10-11 13:57:55,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 16 states have internal predecessors, (48), 6 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 6 states have call successors, (17) [2024-10-11 13:57:55,637 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 647 transitions. [2024-10-11 13:57:55,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-11 13:57:55,638 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:57:55,638 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:57:55,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 13:57:55,638 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:57:55,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:57:55,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1784460971, now seen corresponding path program 1 times [2024-10-11 13:57:55,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:57:55,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178110903] [2024-10-11 13:57:55,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:57:55,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:57:55,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:57,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:57:57,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:57,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:57:57,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:57,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:57:57,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:57,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:57:57,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:57,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:57:57,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:57,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:57:57,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:57,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:57:57,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:57,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:57:57,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:57,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:57:57,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:57,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:57:57,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:57,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:57:57,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:57,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:57:57,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:57,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:57:57,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:57,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:57:57,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:57,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:57:57,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:57,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:57:57,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:57,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:57:57,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:57,464 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:57:57,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:57:57,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178110903] [2024-10-11 13:57:57,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178110903] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:57:57,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:57:57,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-11 13:57:57,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410069949] [2024-10-11 13:57:57,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:57:57,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 13:57:57,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:57:57,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 13:57:57,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-10-11 13:57:57,467 INFO L87 Difference]: Start difference. First operand 483 states and 647 transitions. Second operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-11 13:57:58,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:57:58,656 INFO L93 Difference]: Finished difference Result 968 states and 1295 transitions. [2024-10-11 13:57:58,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 13:57:58,657 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 130 [2024-10-11 13:57:58,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:57:58,664 INFO L225 Difference]: With dead ends: 968 [2024-10-11 13:57:58,664 INFO L226 Difference]: Without dead ends: 486 [2024-10-11 13:57:58,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2024-10-11 13:57:58,668 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 278 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 13:57:58,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 596 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1009 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 13:57:58,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2024-10-11 13:57:58,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 483. [2024-10-11 13:57:58,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 440 states have (on average 1.2795454545454545) internal successors, (563), 442 states have internal predecessors, (563), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 13:57:58,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 639 transitions. [2024-10-11 13:57:58,736 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 639 transitions. Word has length 130 [2024-10-11 13:57:58,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:57:58,737 INFO L471 AbstractCegarLoop]: Abstraction has 483 states and 639 transitions. [2024-10-11 13:57:58,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-11 13:57:58,737 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 639 transitions. [2024-10-11 13:57:58,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-11 13:57:58,739 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:57:58,739 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:57:58,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 13:57:58,740 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:57:58,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:57:58,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1063362207, now seen corresponding path program 1 times [2024-10-11 13:57:58,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:57:58,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649146426] [2024-10-11 13:57:58,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:57:58,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:57:58,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:59,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:57:59,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:59,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:57:59,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:59,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:57:59,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:59,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:57:59,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:59,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:57:59,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:59,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:57:59,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:59,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:57:59,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:59,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:57:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:59,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:57:59,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:59,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:57:59,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:59,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:57:59,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:59,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:57:59,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:59,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:57:59,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:59,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:57:59,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:59,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:57:59,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:59,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:57:59,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:59,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:57:59,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:59,371 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:57:59,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:57:59,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649146426] [2024-10-11 13:57:59,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649146426] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:57:59,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:57:59,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 13:57:59,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114559808] [2024-10-11 13:57:59,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:57:59,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:57:59,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:57:59,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:57:59,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:57:59,374 INFO L87 Difference]: Start difference. First operand 483 states and 639 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:57:59,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:57:59,792 INFO L93 Difference]: Finished difference Result 1047 states and 1390 transitions. [2024-10-11 13:57:59,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:57:59,794 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 130 [2024-10-11 13:57:59,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:57:59,797 INFO L225 Difference]: With dead ends: 1047 [2024-10-11 13:57:59,797 INFO L226 Difference]: Without dead ends: 565 [2024-10-11 13:57:59,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:57:59,799 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 181 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:57:59,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 280 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:57:59,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2024-10-11 13:57:59,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 483. [2024-10-11 13:57:59,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 440 states have (on average 1.2704545454545455) internal successors, (559), 442 states have internal predecessors, (559), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 13:57:59,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 635 transitions. [2024-10-11 13:57:59,868 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 635 transitions. Word has length 130 [2024-10-11 13:57:59,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:57:59,868 INFO L471 AbstractCegarLoop]: Abstraction has 483 states and 635 transitions. [2024-10-11 13:57:59,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:57:59,869 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 635 transitions. [2024-10-11 13:57:59,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-11 13:57:59,870 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:57:59,870 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:57:59,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 13:57:59,870 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:57:59,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:57:59,871 INFO L85 PathProgramCache]: Analyzing trace with hash 465100281, now seen corresponding path program 1 times [2024-10-11 13:57:59,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:57:59,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727090050] [2024-10-11 13:57:59,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:57:59,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:57:59,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:00,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:58:00,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:00,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:58:00,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:00,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:58:00,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:00,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:58:00,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:00,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:58:00,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:00,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:58:00,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:00,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:58:00,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:00,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:58:00,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:00,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:58:00,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:00,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:58:00,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:00,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:58:00,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:00,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:58:00,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:00,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:58:00,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:00,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:58:00,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:00,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:58:00,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:00,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:58:00,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:00,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:58:00,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:00,059 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:58:00,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:58:00,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727090050] [2024-10-11 13:58:00,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727090050] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:00,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:00,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:58:00,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550823504] [2024-10-11 13:58:00,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:00,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:58:00,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:58:00,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:58:00,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:58:00,060 INFO L87 Difference]: Start difference. First operand 483 states and 635 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:58:00,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:00,235 INFO L93 Difference]: Finished difference Result 744 states and 979 transitions. [2024-10-11 13:58:00,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:58:00,236 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 130 [2024-10-11 13:58:00,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:00,238 INFO L225 Difference]: With dead ends: 744 [2024-10-11 13:58:00,238 INFO L226 Difference]: Without dead ends: 472 [2024-10-11 13:58:00,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:58:00,240 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 17 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:58:00,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 178 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:58:00,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2024-10-11 13:58:00,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 466. [2024-10-11 13:58:00,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 423 states have (on average 1.2647754137115839) internal successors, (535), 425 states have internal predecessors, (535), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 13:58:00,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 611 transitions. [2024-10-11 13:58:00,305 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 611 transitions. Word has length 130 [2024-10-11 13:58:00,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:00,305 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 611 transitions. [2024-10-11 13:58:00,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:58:00,306 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 611 transitions. [2024-10-11 13:58:00,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 13:58:00,307 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:00,307 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:58:00,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 13:58:00,307 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:00,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:00,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1567230613, now seen corresponding path program 1 times [2024-10-11 13:58:00,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:00,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69248518] [2024-10-11 13:58:00,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:00,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:00,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:00,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:58:00,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:00,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:58:00,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:00,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:58:00,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:00,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:58:00,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:00,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:58:00,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:01,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:58:01,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:01,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:58:01,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:01,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:58:01,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:01,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:58:01,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:01,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:58:01,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:01,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:58:01,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:01,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:58:01,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:01,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:58:01,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:01,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:58:01,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:01,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:58:01,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:01,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:58:01,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:01,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:58:01,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:01,046 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:58:01,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:58:01,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69248518] [2024-10-11 13:58:01,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69248518] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:01,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:01,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 13:58:01,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230707517] [2024-10-11 13:58:01,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:01,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 13:58:01,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:58:01,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 13:58:01,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:58:01,048 INFO L87 Difference]: Start difference. First operand 466 states and 611 transitions. Second operand has 9 states, 8 states have (on average 6.125) internal successors, (49), 9 states have internal predecessors, (49), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-11 13:58:01,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:01,586 INFO L93 Difference]: Finished difference Result 905 states and 1188 transitions. [2024-10-11 13:58:01,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:58:01,587 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 9 states have internal predecessors, (49), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 131 [2024-10-11 13:58:01,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:01,589 INFO L225 Difference]: With dead ends: 905 [2024-10-11 13:58:01,589 INFO L226 Difference]: Without dead ends: 440 [2024-10-11 13:58:01,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:58:01,591 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 145 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:58:01,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 202 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:58:01,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2024-10-11 13:58:01,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 439. [2024-10-11 13:58:01,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 386 states have (on average 1.2435233160621761) internal successors, (480), 389 states have internal predecessors, (480), 46 states have call successors, (46), 6 states have call predecessors, (46), 6 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-11 13:58:01,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 572 transitions. [2024-10-11 13:58:01,669 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 572 transitions. Word has length 131 [2024-10-11 13:58:01,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:01,669 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 572 transitions. [2024-10-11 13:58:01,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.125) internal successors, (49), 9 states have internal predecessors, (49), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-11 13:58:01,670 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 572 transitions. [2024-10-11 13:58:01,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-11 13:58:01,671 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:01,671 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:58:01,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 13:58:01,671 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:01,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:01,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1807281259, now seen corresponding path program 1 times [2024-10-11 13:58:01,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:01,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479501855] [2024-10-11 13:58:01,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:01,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:01,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:02,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:58:02,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:02,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:58:02,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:02,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:58:02,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:02,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:58:02,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:02,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:58:02,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:02,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:58:02,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:02,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:58:02,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:02,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:58:02,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:02,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:58:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:02,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:58:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:02,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:58:02,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:02,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:58:02,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:02,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:58:02,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:02,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:58:02,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:02,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:58:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:02,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:58:02,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:02,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:58:02,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:02,266 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:58:02,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:58:02,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479501855] [2024-10-11 13:58:02,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479501855] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:02,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:02,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 13:58:02,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219808434] [2024-10-11 13:58:02,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:02,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 13:58:02,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:58:02,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 13:58:02,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:58:02,268 INFO L87 Difference]: Start difference. First operand 439 states and 572 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:58:02,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:02,760 INFO L93 Difference]: Finished difference Result 957 states and 1250 transitions. [2024-10-11 13:58:02,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 13:58:02,761 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2024-10-11 13:58:02,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:02,763 INFO L225 Difference]: With dead ends: 957 [2024-10-11 13:58:02,763 INFO L226 Difference]: Without dead ends: 543 [2024-10-11 13:58:02,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2024-10-11 13:58:02,766 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 128 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:58:02,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 452 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:58:02,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2024-10-11 13:58:02,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 505. [2024-10-11 13:58:02,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 452 states have (on average 1.2433628318584071) internal successors, (562), 455 states have internal predecessors, (562), 46 states have call successors, (46), 6 states have call predecessors, (46), 6 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-11 13:58:02,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 654 transitions. [2024-10-11 13:58:02,852 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 654 transitions. Word has length 134 [2024-10-11 13:58:02,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:02,852 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 654 transitions. [2024-10-11 13:58:02,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:58:02,852 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 654 transitions. [2024-10-11 13:58:02,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-11 13:58:02,853 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:02,854 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:58:02,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 13:58:02,854 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:02,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:02,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1303487422, now seen corresponding path program 1 times [2024-10-11 13:58:02,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:02,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799573889] [2024-10-11 13:58:02,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:02,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:02,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:03,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:58:03,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:03,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:58:03,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:03,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:58:03,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:03,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:58:03,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:03,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:58:03,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:03,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:58:03,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:03,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:58:03,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:03,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:58:03,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:04,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:58:04,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:04,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:58:04,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:04,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:58:04,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:04,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:58:04,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:04,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:58:04,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:04,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:58:04,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:04,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:58:04,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:04,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:58:04,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:04,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:58:04,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:04,048 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:58:04,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:58:04,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799573889] [2024-10-11 13:58:04,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799573889] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:04,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:04,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 13:58:04,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379250502] [2024-10-11 13:58:04,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:04,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:58:04,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:58:04,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:58:04,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:58:04,050 INFO L87 Difference]: Start difference. First operand 505 states and 654 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:58:04,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:04,816 INFO L93 Difference]: Finished difference Result 1135 states and 1463 transitions. [2024-10-11 13:58:04,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:58:04,818 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2024-10-11 13:58:04,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:04,821 INFO L225 Difference]: With dead ends: 1135 [2024-10-11 13:58:04,821 INFO L226 Difference]: Without dead ends: 655 [2024-10-11 13:58:04,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:58:04,823 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 209 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 13:58:04,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 249 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 13:58:04,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2024-10-11 13:58:04,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 617. [2024-10-11 13:58:04,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 564 states have (on average 1.2287234042553192) internal successors, (693), 567 states have internal predecessors, (693), 46 states have call successors, (46), 6 states have call predecessors, (46), 6 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-11 13:58:04,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 785 transitions. [2024-10-11 13:58:04,944 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 785 transitions. Word has length 134 [2024-10-11 13:58:04,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:04,944 INFO L471 AbstractCegarLoop]: Abstraction has 617 states and 785 transitions. [2024-10-11 13:58:04,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:58:04,944 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 785 transitions. [2024-10-11 13:58:04,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-11 13:58:04,945 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:04,945 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:58:04,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 13:58:04,945 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:04,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:04,945 INFO L85 PathProgramCache]: Analyzing trace with hash -192655791, now seen corresponding path program 1 times [2024-10-11 13:58:04,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:04,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514310791] [2024-10-11 13:58:04,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:04,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:04,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:05,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:58:05,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:05,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:58:05,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:05,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:58:05,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:05,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:58:05,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:05,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:58:05,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:05,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:58:05,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:05,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:58:05,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:05,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:58:05,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:05,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:58:05,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:05,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:58:05,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:05,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:58:05,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:05,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:58:05,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:05,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:58:05,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:05,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:58:05,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:05,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:58:05,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:05,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:58:05,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:05,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:58:05,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:05,119 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:58:05,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:58:05,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514310791] [2024-10-11 13:58:05,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514310791] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:05,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:05,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:58:05,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118158060] [2024-10-11 13:58:05,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:05,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:58:05,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:58:05,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:58:05,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:58:05,121 INFO L87 Difference]: Start difference. First operand 617 states and 785 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:58:05,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:05,286 INFO L93 Difference]: Finished difference Result 1311 states and 1668 transitions. [2024-10-11 13:58:05,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:58:05,287 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2024-10-11 13:58:05,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:05,290 INFO L225 Difference]: With dead ends: 1311 [2024-10-11 13:58:05,290 INFO L226 Difference]: Without dead ends: 719 [2024-10-11 13:58:05,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:58:05,292 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 51 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:58:05,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 294 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:58:05,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2024-10-11 13:58:05,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 643. [2024-10-11 13:58:05,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 590 states have (on average 1.2186440677966102) internal successors, (719), 593 states have internal predecessors, (719), 46 states have call successors, (46), 6 states have call predecessors, (46), 6 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-11 13:58:05,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 811 transitions. [2024-10-11 13:58:05,367 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 811 transitions. Word has length 134 [2024-10-11 13:58:05,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:05,367 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 811 transitions. [2024-10-11 13:58:05,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:58:05,368 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 811 transitions. [2024-10-11 13:58:05,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-11 13:58:05,369 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:05,369 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:58:05,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 13:58:05,369 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:05,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:05,370 INFO L85 PathProgramCache]: Analyzing trace with hash 991542824, now seen corresponding path program 1 times [2024-10-11 13:58:05,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:05,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495739434] [2024-10-11 13:58:05,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:05,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:05,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:06,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:58:06,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:06,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:58:06,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:06,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:58:06,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:06,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:58:06,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:06,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:58:06,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:06,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:58:06,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:06,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:58:06,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:06,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:58:06,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:06,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:58:06,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:06,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:58:06,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:06,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:58:06,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:06,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:58:06,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:06,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:58:06,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:06,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:58:06,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:06,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:58:06,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:06,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:58:06,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:06,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:58:06,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:06,110 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:58:06,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:58:06,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495739434] [2024-10-11 13:58:06,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495739434] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:06,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:06,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 13:58:06,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662935126] [2024-10-11 13:58:06,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:06,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:58:06,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:58:06,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:58:06,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:58:06,112 INFO L87 Difference]: Start difference. First operand 643 states and 811 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 13:58:06,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:06,647 INFO L93 Difference]: Finished difference Result 1505 states and 1896 transitions. [2024-10-11 13:58:06,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:58:06,648 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 134 [2024-10-11 13:58:06,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:06,652 INFO L225 Difference]: With dead ends: 1505 [2024-10-11 13:58:06,652 INFO L226 Difference]: Without dead ends: 887 [2024-10-11 13:58:06,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:58:06,654 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 236 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:58:06,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 236 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:58:06,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2024-10-11 13:58:06,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 739. [2024-10-11 13:58:06,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 686 states have (on average 1.2230320699708455) internal successors, (839), 689 states have internal predecessors, (839), 46 states have call successors, (46), 6 states have call predecessors, (46), 6 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-11 13:58:06,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 931 transitions. [2024-10-11 13:58:06,744 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 931 transitions. Word has length 134 [2024-10-11 13:58:06,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:06,744 INFO L471 AbstractCegarLoop]: Abstraction has 739 states and 931 transitions. [2024-10-11 13:58:06,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 13:58:06,744 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 931 transitions. [2024-10-11 13:58:06,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-11 13:58:06,746 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:06,746 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:58:06,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 13:58:06,746 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:06,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:06,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1578348838, now seen corresponding path program 1 times [2024-10-11 13:58:06,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:06,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860975548] [2024-10-11 13:58:06,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:06,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:06,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:07,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:58:07,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:07,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:58:07,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:07,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:58:07,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:07,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:58:07,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:07,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:58:07,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:07,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:58:07,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:07,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:58:07,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:07,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:58:07,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:07,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:58:07,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:07,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:58:07,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:07,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:58:07,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:07,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:58:07,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:07,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:58:07,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:07,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:58:07,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:07,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:58:07,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:07,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:58:07,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:07,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:58:07,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:07,709 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 12 proven. 36 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-11 13:58:07,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:58:07,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860975548] [2024-10-11 13:58:07,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860975548] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:58:07,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611169058] [2024-10-11 13:58:07,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:07,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:58:07,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:58:07,712 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 13:58:07,713 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 13:58:07,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:07,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-11 13:58:07,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:58:08,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 13:58:08,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 13:58:08,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 13:58:08,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 13:58:09,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 13:58:09,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 13:58:09,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 13:58:09,525 INFO L349 Elim1Store]: treesize reduction 60, result has 41.7 percent of original size [2024-10-11 13:58:09,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 62 [2024-10-11 13:58:09,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-11 13:58:09,610 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 165 proven. 195 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-10-11 13:58:09,610 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:58:13,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611169058] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:58:13,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 13:58:13,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2024-10-11 13:58:13,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997494406] [2024-10-11 13:58:13,815 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 13:58:13,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 13:58:13,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:58:13,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 13:58:13,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=389, Unknown=1, NotChecked=0, Total=462 [2024-10-11 13:58:13,818 INFO L87 Difference]: Start difference. First operand 739 states and 931 transitions. Second operand has 19 states, 17 states have (on average 5.352941176470588) internal successors, (91), 19 states have internal predecessors, (91), 9 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 7 states have call predecessors, (34), 9 states have call successors, (34) [2024-10-11 13:58:15,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:15,008 INFO L93 Difference]: Finished difference Result 1364 states and 1710 transitions. [2024-10-11 13:58:15,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 13:58:15,009 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 5.352941176470588) internal successors, (91), 19 states have internal predecessors, (91), 9 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 7 states have call predecessors, (34), 9 states have call successors, (34) Word has length 134 [2024-10-11 13:58:15,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:15,013 INFO L225 Difference]: With dead ends: 1364 [2024-10-11 13:58:15,013 INFO L226 Difference]: Without dead ends: 868 [2024-10-11 13:58:15,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=206, Invalid=785, Unknown=1, NotChecked=0, Total=992 [2024-10-11 13:58:15,015 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 266 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 1033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 13:58:15,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 409 Invalid, 1033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 13:58:15,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2024-10-11 13:58:15,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 860. [2024-10-11 13:58:15,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 860 states, 790 states have (on average 1.2139240506329114) internal successors, (959), 797 states have internal predecessors, (959), 58 states have call successors, (58), 11 states have call predecessors, (58), 11 states have return successors, (58), 51 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-11 13:58:15,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1075 transitions. [2024-10-11 13:58:15,151 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1075 transitions. Word has length 134 [2024-10-11 13:58:15,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:15,152 INFO L471 AbstractCegarLoop]: Abstraction has 860 states and 1075 transitions. [2024-10-11 13:58:15,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 5.352941176470588) internal successors, (91), 19 states have internal predecessors, (91), 9 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 7 states have call predecessors, (34), 9 states have call successors, (34) [2024-10-11 13:58:15,152 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1075 transitions. [2024-10-11 13:58:15,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-11 13:58:15,153 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:15,154 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:58:15,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 13:58:15,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-10-11 13:58:15,355 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:15,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:15,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1217686626, now seen corresponding path program 1 times [2024-10-11 13:58:15,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:15,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730308258] [2024-10-11 13:58:15,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:15,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:15,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:15,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:58:15,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:15,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:58:15,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:15,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:58:15,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:15,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:58:15,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:15,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:58:15,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:15,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:58:15,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:15,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:58:15,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:15,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:58:15,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:15,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:58:15,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:15,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:58:15,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:15,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:58:15,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:15,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:58:15,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:15,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:58:15,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:15,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:58:15,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:15,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:58:15,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:15,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:58:15,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:15,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:58:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:15,837 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:58:15,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:58:15,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730308258] [2024-10-11 13:58:15,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730308258] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:15,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:15,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 13:58:15,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128802694] [2024-10-11 13:58:15,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:15,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 13:58:15,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:58:15,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 13:58:15,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:58:15,841 INFO L87 Difference]: Start difference. First operand 860 states and 1075 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:58:16,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:16,332 INFO L93 Difference]: Finished difference Result 1485 states and 1860 transitions. [2024-10-11 13:58:16,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:58:16,333 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 134 [2024-10-11 13:58:16,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:16,336 INFO L225 Difference]: With dead ends: 1485 [2024-10-11 13:58:16,336 INFO L226 Difference]: Without dead ends: 928 [2024-10-11 13:58:16,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:58:16,338 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 260 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:58:16,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 277 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:58:16,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2024-10-11 13:58:16,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 860. [2024-10-11 13:58:16,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 860 states, 790 states have (on average 1.2088607594936709) internal successors, (955), 797 states have internal predecessors, (955), 58 states have call successors, (58), 11 states have call predecessors, (58), 11 states have return successors, (58), 51 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-11 13:58:16,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1071 transitions. [2024-10-11 13:58:16,454 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1071 transitions. Word has length 134 [2024-10-11 13:58:16,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:16,455 INFO L471 AbstractCegarLoop]: Abstraction has 860 states and 1071 transitions. [2024-10-11 13:58:16,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:58:16,455 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1071 transitions. [2024-10-11 13:58:16,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-11 13:58:16,456 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:16,457 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:58:16,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 13:58:16,457 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:16,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:16,457 INFO L85 PathProgramCache]: Analyzing trace with hash 408340000, now seen corresponding path program 1 times [2024-10-11 13:58:16,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:16,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055864905] [2024-10-11 13:58:16,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:16,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:16,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:18,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:58:18,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:18,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:58:18,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:18,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:58:18,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:18,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:58:18,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:18,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:58:18,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:18,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:58:18,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:18,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:58:18,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:18,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:58:18,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:18,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:58:18,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:18,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:58:18,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:18,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:58:18,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:18,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:58:18,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:18,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:58:18,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:18,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:58:18,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:18,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:58:18,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:18,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:58:18,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:18,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:58:18,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:18,350 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:58:18,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:58:18,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055864905] [2024-10-11 13:58:18,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055864905] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:18,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:18,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-11 13:58:18,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539131200] [2024-10-11 13:58:18,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:18,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 13:58:18,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:58:18,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 13:58:18,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-10-11 13:58:18,353 INFO L87 Difference]: Start difference. First operand 860 states and 1071 transitions. Second operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-11 13:58:19,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:19,663 INFO L93 Difference]: Finished difference Result 1491 states and 1860 transitions. [2024-10-11 13:58:19,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 13:58:19,664 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 134 [2024-10-11 13:58:19,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:19,668 INFO L225 Difference]: With dead ends: 1491 [2024-10-11 13:58:19,668 INFO L226 Difference]: Without dead ends: 934 [2024-10-11 13:58:19,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2024-10-11 13:58:19,670 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 408 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 1098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 13:58:19,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 525 Invalid, 1098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1037 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 13:58:19,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2024-10-11 13:58:19,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 854. [2024-10-11 13:58:19,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 854 states, 784 states have (on average 1.2079081632653061) internal successors, (947), 791 states have internal predecessors, (947), 58 states have call successors, (58), 11 states have call predecessors, (58), 11 states have return successors, (58), 51 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-11 13:58:19,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1063 transitions. [2024-10-11 13:58:19,821 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1063 transitions. Word has length 134 [2024-10-11 13:58:19,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:19,822 INFO L471 AbstractCegarLoop]: Abstraction has 854 states and 1063 transitions. [2024-10-11 13:58:19,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-11 13:58:19,822 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1063 transitions. [2024-10-11 13:58:19,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-11 13:58:19,823 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:19,824 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:58:19,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-11 13:58:19,824 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:19,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:19,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1877954507, now seen corresponding path program 1 times [2024-10-11 13:58:19,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:19,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944450247] [2024-10-11 13:58:19,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:19,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:19,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:21,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:58:21,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:21,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:58:21,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:21,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:58:21,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:21,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:58:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:21,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:58:21,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:21,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:58:21,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:21,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:58:21,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:21,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:58:21,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:21,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:58:21,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:21,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:58:21,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:21,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:58:21,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:21,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:58:21,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:21,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:58:21,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:21,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:58:21,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:21,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:58:21,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:21,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:58:21,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:21,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:58:21,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:21,573 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:58:21,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:58:21,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944450247] [2024-10-11 13:58:21,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944450247] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:21,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:21,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 13:58:21,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085553064] [2024-10-11 13:58:21,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:21,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 13:58:21,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:58:21,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 13:58:21,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:58:21,575 INFO L87 Difference]: Start difference. First operand 854 states and 1063 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-11 13:58:22,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:22,251 INFO L93 Difference]: Finished difference Result 1455 states and 1814 transitions. [2024-10-11 13:58:22,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:58:22,251 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 135 [2024-10-11 13:58:22,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:22,255 INFO L225 Difference]: With dead ends: 1455 [2024-10-11 13:58:22,255 INFO L226 Difference]: Without dead ends: 904 [2024-10-11 13:58:22,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-10-11 13:58:22,257 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 164 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:58:22,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 224 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:58:22,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2024-10-11 13:58:22,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 844. [2024-10-11 13:58:22,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 844 states, 774 states have (on average 1.202842377260982) internal successors, (931), 781 states have internal predecessors, (931), 58 states have call successors, (58), 11 states have call predecessors, (58), 11 states have return successors, (58), 51 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-11 13:58:22,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1047 transitions. [2024-10-11 13:58:22,398 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1047 transitions. Word has length 135 [2024-10-11 13:58:22,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:22,398 INFO L471 AbstractCegarLoop]: Abstraction has 844 states and 1047 transitions. [2024-10-11 13:58:22,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-11 13:58:22,399 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1047 transitions. [2024-10-11 13:58:22,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 13:58:22,400 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:22,400 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:58:22,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-11 13:58:22,401 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:22,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:22,401 INFO L85 PathProgramCache]: Analyzing trace with hash 935807935, now seen corresponding path program 1 times [2024-10-11 13:58:22,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:22,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743623721] [2024-10-11 13:58:22,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:22,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:22,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:22,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:58:22,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:22,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:58:22,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:22,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:58:22,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:22,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:58:22,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:22,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:58:22,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:22,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:58:22,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:22,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:58:22,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:22,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:58:22,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:22,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:58:22,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:22,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:58:22,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:22,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:58:22,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:22,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:58:22,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:22,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:58:22,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:22,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:58:22,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:22,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:58:22,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:22,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:58:22,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:22,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:58:22,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:22,632 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:58:22,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:58:22,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743623721] [2024-10-11 13:58:22,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743623721] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:22,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:22,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:58:22,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224778351] [2024-10-11 13:58:22,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:22,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:58:22,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:58:22,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:58:22,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:58:22,634 INFO L87 Difference]: Start difference. First operand 844 states and 1047 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:58:22,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:22,903 INFO L93 Difference]: Finished difference Result 1727 states and 2143 transitions. [2024-10-11 13:58:22,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:58:22,904 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2024-10-11 13:58:22,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:22,908 INFO L225 Difference]: With dead ends: 1727 [2024-10-11 13:58:22,908 INFO L226 Difference]: Without dead ends: 912 [2024-10-11 13:58:22,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:58:22,910 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 36 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:58:22,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 273 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:58:22,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2024-10-11 13:58:23,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 878. [2024-10-11 13:58:23,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 808 states have (on average 1.1943069306930694) internal successors, (965), 815 states have internal predecessors, (965), 58 states have call successors, (58), 11 states have call predecessors, (58), 11 states have return successors, (58), 51 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-11 13:58:23,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1081 transitions. [2024-10-11 13:58:23,053 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1081 transitions. Word has length 136 [2024-10-11 13:58:23,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:23,054 INFO L471 AbstractCegarLoop]: Abstraction has 878 states and 1081 transitions. [2024-10-11 13:58:23,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:58:23,054 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1081 transitions. [2024-10-11 13:58:23,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 13:58:23,055 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:23,056 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:58:23,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-11 13:58:23,056 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:23,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:23,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1758151107, now seen corresponding path program 1 times [2024-10-11 13:58:23,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:23,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52193070] [2024-10-11 13:58:23,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:23,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:23,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:23,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:58:23,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:23,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:58:23,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:23,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:58:23,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:23,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:58:23,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:23,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:58:23,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:23,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:58:23,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:23,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:58:23,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:23,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:58:23,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:23,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:58:23,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:23,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:58:23,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:23,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:58:23,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:23,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:58:23,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:23,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:58:23,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:23,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:58:23,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:23,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:58:23,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:23,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:58:23,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:23,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:58:23,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:23,335 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:58:23,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:58:23,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52193070] [2024-10-11 13:58:23,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52193070] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:23,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:23,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:58:23,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502410595] [2024-10-11 13:58:23,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:23,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:58:23,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:58:23,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:58:23,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:58:23,337 INFO L87 Difference]: Start difference. First operand 878 states and 1081 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:58:23,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:23,750 INFO L93 Difference]: Finished difference Result 1665 states and 2055 transitions. [2024-10-11 13:58:23,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:58:23,751 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2024-10-11 13:58:23,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:23,753 INFO L225 Difference]: With dead ends: 1665 [2024-10-11 13:58:23,754 INFO L226 Difference]: Without dead ends: 816 [2024-10-11 13:58:23,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:58:23,755 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 105 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:58:23,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 242 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:58:23,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2024-10-11 13:58:23,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 724. [2024-10-11 13:58:23,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 654 states have (on average 1.1758409785932722) internal successors, (769), 661 states have internal predecessors, (769), 58 states have call successors, (58), 11 states have call predecessors, (58), 11 states have return successors, (58), 51 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-11 13:58:23,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 885 transitions. [2024-10-11 13:58:23,914 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 885 transitions. Word has length 136 [2024-10-11 13:58:23,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:23,914 INFO L471 AbstractCegarLoop]: Abstraction has 724 states and 885 transitions. [2024-10-11 13:58:23,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:58:23,915 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 885 transitions. [2024-10-11 13:58:23,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 13:58:23,916 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:23,916 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:58:23,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-11 13:58:23,917 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:23,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:23,917 INFO L85 PathProgramCache]: Analyzing trace with hash 878021684, now seen corresponding path program 1 times [2024-10-11 13:58:23,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:23,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329485860] [2024-10-11 13:58:23,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:23,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:23,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:24,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:58:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:24,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:58:24,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:24,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:58:24,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:24,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:58:24,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:24,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:58:24,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:24,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:58:24,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:24,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:58:24,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:24,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:58:24,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:24,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:58:24,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:24,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:58:24,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:24,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:58:24,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:24,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:58:24,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:24,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:58:24,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:24,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:58:24,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:24,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:58:24,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:24,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:58:24,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:24,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:58:24,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:24,406 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:58:24,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:58:24,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329485860] [2024-10-11 13:58:24,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329485860] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:24,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:24,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 13:58:24,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932014950] [2024-10-11 13:58:24,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:24,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:58:24,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:58:24,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:58:24,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:58:24,408 INFO L87 Difference]: Start difference. First operand 724 states and 885 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 13:58:24,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:24,852 INFO L93 Difference]: Finished difference Result 740 states and 903 transitions. [2024-10-11 13:58:24,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:58:24,853 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 136 [2024-10-11 13:58:24,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:24,856 INFO L225 Difference]: With dead ends: 740 [2024-10-11 13:58:24,856 INFO L226 Difference]: Without dead ends: 738 [2024-10-11 13:58:24,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:58:24,859 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 122 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:58:24,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 388 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:58:24,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2024-10-11 13:58:25,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 736. [2024-10-11 13:58:25,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 666 states have (on average 1.1726726726726726) internal successors, (781), 673 states have internal predecessors, (781), 58 states have call successors, (58), 11 states have call predecessors, (58), 11 states have return successors, (58), 51 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-11 13:58:25,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 897 transitions. [2024-10-11 13:58:25,056 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 897 transitions. Word has length 136 [2024-10-11 13:58:25,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:25,057 INFO L471 AbstractCegarLoop]: Abstraction has 736 states and 897 transitions. [2024-10-11 13:58:25,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 13:58:25,057 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 897 transitions. [2024-10-11 13:58:25,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-11 13:58:25,059 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:25,059 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:58:25,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-11 13:58:25,059 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:25,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:25,059 INFO L85 PathProgramCache]: Analyzing trace with hash -466579255, now seen corresponding path program 1 times [2024-10-11 13:58:25,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:25,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643281483] [2024-10-11 13:58:25,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:25,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:25,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:25,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:58:25,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:25,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:58:25,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:25,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:58:25,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:25,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:58:25,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:25,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:58:25,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:25,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:58:25,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:25,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:58:25,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:25,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:58:25,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:25,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:58:25,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:25,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:58:25,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:25,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:58:25,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:25,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:58:25,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:25,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:58:25,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:25,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:58:25,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:25,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:58:25,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:25,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:58:25,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:25,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:58:25,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:25,381 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:58:25,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:58:25,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643281483] [2024-10-11 13:58:25,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643281483] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:25,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:25,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 13:58:25,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724595715] [2024-10-11 13:58:25,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:25,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:58:25,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:58:25,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:58:25,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:58:25,383 INFO L87 Difference]: Start difference. First operand 736 states and 897 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 13:58:25,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:25,797 INFO L93 Difference]: Finished difference Result 1328 states and 1621 transitions. [2024-10-11 13:58:25,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:58:25,797 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 138 [2024-10-11 13:58:25,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:25,800 INFO L225 Difference]: With dead ends: 1328 [2024-10-11 13:58:25,800 INFO L226 Difference]: Without dead ends: 591 [2024-10-11 13:58:25,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 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 13:58:25,802 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 162 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:58:25,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 167 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:58:25,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2024-10-11 13:58:25,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 587. [2024-10-11 13:58:25,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 524 states have (on average 1.1526717557251909) internal successors, (604), 529 states have internal predecessors, (604), 52 states have call successors, (52), 10 states have call predecessors, (52), 10 states have return successors, (52), 47 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 13:58:25,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 708 transitions. [2024-10-11 13:58:25,927 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 708 transitions. Word has length 138 [2024-10-11 13:58:25,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:25,928 INFO L471 AbstractCegarLoop]: Abstraction has 587 states and 708 transitions. [2024-10-11 13:58:25,928 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 13:58:25,928 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 708 transitions. [2024-10-11 13:58:25,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-11 13:58:25,929 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:25,929 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:58:25,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-11 13:58:25,929 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:25,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:25,930 INFO L85 PathProgramCache]: Analyzing trace with hash -2078910372, now seen corresponding path program 1 times [2024-10-11 13:58:25,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:25,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104727004] [2024-10-11 13:58:25,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:25,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:26,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat